Scheduling Job Families on a Single Machine
Main Article Content
Abstract
The problem of scheduling n jobs on a single machine is considered, where the jobs are partitioned into several families and a set – up time is necessary between jobs of different families. The objective is to find a lower bound for the problem of minimizing the sum of completion times and the maximum tardiness. This paper uses a decomposition property to find a lower bound in order to incorporated in a branch and bound algorithm for constructing an optimal schedule.
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
How to Cite
References
Bayati , S.S. 2000. Single machine scheduling with set-up times to minimize multiple objective function, MSc thesis, Univ. of Al-Mustansiriyah, College of Science, Dept. of Mathematics.
Abdullah, H.F. 2001. Scheduling groups of jobs on a single machine ,MSc thesis, Univ. of Al-Mustansiriyah , College of Science Dept.of Mathematics .
Anderson, E.J., Glass C.A. and Potts C.N. 2007. Applications of local search in machine scheduling. Oper. Res. 8(3): 120 – 136 .
Mason, A.J. and Anderson. E.J.1991. Minimizing flow time on single machine with job classes and set-up times. Naval Res. Logistic. 6(38): 333-350.
Ramadhan, A.M. 1998. Single machine Scheduling using branch and bound techniques , M Sc thesis , Univ. of Al-Mustansiriyah , College of Science , Dept. of Mathematics.
Hillier , F.S. and Lieberman G.J. 2005. Introduction to mathematical Programming , McGraw-Hill, 4th ed. , USA, pp. 559.