A hybrid bounding procedure for the workload allocation problem on parallel unrelated machines with setups

A hybrid bounding procedure for the workload allocation problem on parallel unrelated machines with setups

0.00 Avg rating0 Votes
Article ID: iaor19971361
Country: United Kingdom
Volume: 47
Issue: 10
Start Page Number: 1247
End Page Number: 1261
Publication Date: Oct 1996
Journal: Journal of the Operational Research Society
Authors: ,
Abstract:

A nonpreemptive single stage manufacturing process with parallel, unrelated machines and multiple job types with setups (PUMS) is considered. The authors propose a hybrid approximation procedure where a Lagrangean relaxation dual and a Lagrangean decomposition dual are solved one after the other to generate a good lower bound on the optimal makespan value. Computational results are reported.

Reviews

Required fields are marked *. Your email address will not be published.