# MINIMIZING THE MAKESPAN IN TWO-MACHINE JOB SHOP SCHEDULING PROBLEMS WITH NO MACHINE IDLE-TIME

### Fatma Hermès, Jacques Carlier, Aziz Moukrim, Khaled Ghédira

#### 2009

#### Abstract

This paper deals with two-machine job shop scheduling problems working under the no-idle constraint, that is, machines must work continuously without idle intervals. The makespan (Cmax) has to be minimized. First, we study the problem where each job consists of at most two operations and we show that it can be solved polynomially using Jackson’s rule (Jackson, 1956). Second, we study the problem where the number of operations per job can be greater than two and all operations are of unit time and we extend the results of (Hefetz and Adiri, 1982). Finally, we discuss the possibility of getting feasible solutions and then optimal solutions in the general case where the number of operations per job can be greater than two and all operations do not have the same processing time.

#### References

- Adiri, I., Pohoryles, D., 1982. Flow-shop/no-idle or nowait scheduling to minimise the sum of completion times. Naval Research Logistics Quarterly, Vol. 29, pp. 495-504.
- Baptiste, P., Lee, K.H., 1997. A branch and bound algorithm for the F|no-idle|Cmax. Proceedings of the International Conference on Industrial Engineering and Production Management (IEPM'1997), Lyon, vol. 1, pp. 429-438.
- Brucker, P., 1994. A polynomial algorithm for the two machine job-shop scheduling problem with fixed number of jobs. Operations Research Spektrum, Vol. 16, pp. 5-7.
- Brucker, P., 1995. Scheduling Algorithms, Springer, ISBN: 3-540-60087-6.
- Chrétienne, P., 2008. On single-machine scheduling without intermediate delays. Discrete Applied Mathematics, 156, p. 2543-2550.
- Garey, M.R.D., Johnson, D.S., Sethi, R., 1976. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, Vol. 1, pp. 117-129.
- Hefetz, N. , Adiri, I., 1982. An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem. Mathematics of Operations Research, Vol. 7, No. 3., pp. 354-360.
- Jackson, J.R., 1956. An extension of Johnson's results on job lot scheduling. Naval Research Logistic Quarterly, Vol. 3, pp. 201-203.
- Johnson, S.M., 1954. Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, Vol. 1, pp. 61-68.
- Kalczynski, P. J., Kamburowski, J., 2007. On no-wait and no-idle flow shops with makespan criterion. European Journal of Operational Research, Vol. 178, pp. 677-685.
- Lenstra, J. K., Rinnooy Kan, A.H.G., Brucker, P., 1977. Complexity machine scheduling problems. Annals of Discrete Mathematics, Vol. 1, pp. 343-362.
- Saadani, H., Guinet, A., Moalla, M., 2001. A travelling salesman approach to solve the F|no-idle|Cmax problem. Proceedings of the International Conference on Industrial Engineering and Production Management (IEPM' 2001), Quebec, vol. 2, 880-888.
- Saadani, H., Guinet, A., Moalla, M., 2003. Three stage noidle flow-shops. Computers and Industrial Engineering, 44, 425-434.
- Valente, J. M. S., Alves, R. A. F. S., 2005. Improved Heuristics for the Early/Tardy scheduling problem with no idle time. Computers & Operations Research, 32: p. 557-569.
- Valente, J. M. S., 2006. Heuristics for the single machine scheduling problem with early and quadratic tardy penalities. Working paper 234, Faculdade de Economia do Porto, Portugal, December.

#### Paper Citation

#### in Harvard Style

Hermès F., Carlier J., Moukrim A. and Ghédira K. (2009). **MINIMIZING THE MAKESPAN IN TWO-MACHINE JOB SHOP SCHEDULING PROBLEMS WITH NO MACHINE IDLE-TIME** . In *Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO,* ISBN 978-989-8111-99-9, pages 89-96. DOI: 10.5220/0002213500890096

#### in Bibtex Style

@conference{icinco09,

author={Fatma Hermès and Jacques Carlier and Aziz Moukrim and Khaled Ghédira},

title={MINIMIZING THE MAKESPAN IN TWO-MACHINE JOB SHOP SCHEDULING PROBLEMS WITH NO MACHINE IDLE-TIME},

booktitle={Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO,},

year={2009},

pages={89-96},

publisher={SciTePress},

organization={INSTICC},

doi={10.5220/0002213500890096},

isbn={978-989-8111-99-9},

}

#### in EndNote Style

TY - CONF

JO - Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO,

TI - MINIMIZING THE MAKESPAN IN TWO-MACHINE JOB SHOP SCHEDULING PROBLEMS WITH NO MACHINE IDLE-TIME

SN - 978-989-8111-99-9

AU - Hermès F.

AU - Carlier J.

AU - Moukrim A.

AU - Ghédira K.

PY - 2009

SP - 89

EP - 96

DO - 10.5220/0002213500890096