Application of Mixed-Integer Programming and Dispatching Rules on Parallel Machine Scheduling with Inserted Idle Time

Article Preview

Abstract:

This research considers the problem of scheduling jobs on unrelated parallel machines with inserted idle times to minimize the earliness and tardiness. The aims at investigating how particular objective value can be improved by allowing machine idle time and how quality solutions can be more effectively obtained. Two mixed-integer programming formulations combining with three dispatching rules are developed to solve such scheduling problems. They can easy provide the optimal solution to problem involving about nine jobs and four machines. From the results of experiments, it is found that: (1) the inserted idle times decreases objective values more effectively; (2) three dispatching rules are very competitive in terms of efficiency and quality of solutions.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

748-751

Citation:

Online since:

October 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] C.Y. Tsai, Y.C. Wang, The sum of earliness and tardiness minimization on unrelated parallel machines with inserted idle time, presented at the Proceedings of 12th WSEAS International Conference on Applied Computer Science, Singapore City, Singapore, May 11-13, (2012).

Google Scholar

[2] Z. Zhu, R.B. Heady, Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach. Comput. Ind. Eng. 38 (2000) 297-305.

DOI: 10.1016/s0360-8352(00)00048-6

Google Scholar

[3] M.K. Omar, S.C. Teo, Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach. Appl. Math. Comput. 181 (2006) 1008-1017.

DOI: 10.1016/j.amc.2006.01.068

Google Scholar

[4] A. Guinet, Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria. Int. J. Prod. Res. 31(7) (1993) 1579-94.

DOI: 10.1080/00207549308956810

Google Scholar