A Mixed Integer Linear Programming Solution for Insertion of Idle Time in the Jobs Scheduling

DOI

10.2991/scict-14.2014.13How to use a DOI?

Keywords

Jobs scheduling; Unrelated parallel machine; Insertion of Idle Time; Earliness and Tardiness; Mixed-integer programming.

Abstract

This paper considers the use of insertion of idle time in the unrelated parallel machine scheduling problem with an objective of minimizing the sum of earliness and tardiness. An effective and efficient mixed integer linear programming formulation is proposed. For comparison, two models where the use of idle time is restricted and prohibited, respectively, are also developed. The results of the conducted numerical experiment showed ET values can be significantly reduced if idle time is properly inserted before jobs.

Copyright

© 2014, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Chi-Yang Tsai
AU  - Yi-Chen Wang
PY  - 2014/05
DA  - 2014/05
TI  - A Mixed Integer Linear Programming Solution for Insertion of Idle Time in the Jobs Scheduling
BT  - Proceedings of the 2nd International Conference on Soft Computing in Information Communication Technology
PB  - Atlantis Press
SP  - 53
EP  - 56
SN  - 1951-6851
UR  - https://doi.org/10.2991/scict-14.2014.13
DO  - 10.2991/scict-14.2014.13
ID  - Tsai2014/05
ER  -