A polynomial-time branching procedure for the multiprocessor scheduling problem

Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-08-04T13:09:54Z No. of bitstreams: 1 04_96.pdf: 1687112 bytes, checksum: 690a20c810110c7961c70d0b9e1029d6 (MD5)Made available in DSpace on 2017-08-04T13:09:54Z (GMT). No. of bitstreams: 1 04_96.pdf: 1687112 bytes, checksum: 690a20c810110c7961c70d0b9e1029d6 (MD5) Previous issue date: 1996-12-31In this paper, we present and analyze a branching procedure suitable for branchand-bound algorithms for solving multiprocessor scheduling problems. The originality of this branching procedure resides mainly in its ability to enumerate all feasible solutions without generating duplicated subproblems. This procedure is shown to be polynomial in time and space complexities. The main applications of such branching procedure are instances of the MSP where the costs are large because the height of the search tree is linear on the number of tasks to be scheduled. This in opposition to another branching procedure in the literature that generates a search tree whose height is porportional to the costs of the tasks