Article ID: | iaor19991172 |
Country: | Netherlands |
Volume: | 83 |
Issue: | 1 |
Start Page Number: | 59 |
End Page Number: | 76 |
Publication Date: | Oct 1998 |
Journal: | Annals of Operations Research |
Authors: | Hariri A.M.A., Potts C.N., Crauwels H.A.J., Wassenhove L.N. Van |
Keywords: | programming: branch and bound |
This paper presents several branch and bound algorithms for a single-machine scheduling problem with batching. Jobs are partitioned into families, and a set-up time is necessary when there is a switch from processing jobs of one family to jobs of another family. The objective is to minimize the total weighted completion time. A lower bound based on Lagrangian relaxation of the machine capacity constraint is derived. Also, a multiplier adjustment method to find values of the multipliers is proposed. Computational experience with instances having up to 50 jobs shows that the lower bounds are effective in restricting the search.