Hostname: page-component-848d4c4894-8kt4b Total loading time: 0 Render date: 2024-06-24T17:43:55.696Z Has data issue: false hasContentIssue false
  • English
  • Français

Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds

Published online by Cambridge University Press:  11 February 2013

Cyril Briand  and
Samia Ourari
Cyril Briand
Affiliation:
CNRS, LAAS, 7 avenue du colonel Roche, 31077 Toulouse, France.. briand@laas.fr Université de Toulouse, UPS, INSA, INP, ISAE, LAAS, 31077 Toulouse, France
Samia Ourari
Affiliation:
CDTA, lotissement du 20 août 1956, Baba Hassen, Alger, Algeria.; sourari@cdta.dz
Get access

Abstract

This paper considers the problem of scheduling n jobs on a single machine. A fixed processing time and an execution interval are associated with each job. Preemption is not allowed. The objective is to find a feasible job sequence that minimizes the number of tardy jobs. On the basis of an original mathematical integer programming formulation, this paper shows how good-quality lower and upper bounds can be computed. Numerical experiments are provided for assessing the proposed approach.

Keywords

Single machine schedulingtardy jobsdominance conditionsmixed-integer programming
Type
Research Article
Information
RAIRO - Operations Research , Volume 47 , Issue 1 , January 2013 , pp. 33 - 46
Copyright
© EDP Sciences, ROADEF, SMAI, 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Références

Aissi, H., Aloulou, M.A. and Kovalyov, M.Y., Minimizing the number of late jobs on a single machine under due date uncertainty. J. Sched. 14 (2011) 351–360. Google Scholar
Aloulou, M.A. and Della-Croce, F., Complexity of one machine scheduling problems under scenario-based uncertainty. Oper. Res. Lett. 36 (2008) 338–342. Google Scholar
Baptiste, P., Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine when processing times are equal. J. Sched. 2 (1999) 245–252. Google Scholar
Baptiste, P., Peridy, L. and Pinson, E., A branch and bound to mininimze the number of late jobs on a single machine with release time constraints. Eur. J. Oper. Res. 144 (2003) 1–11. Google Scholar
Baptiste, P., Della Croce, F., Grosso, A. and T’kindt, V., Sequencing a single machine with due dates and deadlines : an ILP-based approach to solve very large instances. J. Sched. 13 (2010) 39–47. Google Scholar
Briand, C., Ourari, S. and Bouzouia, B., An efficient ILP formulation for the single machine scheduling problem. RAIRO Oper. Res. 44 (2010) 61–71. Google Scholar
Carlier, J., Problèmes d’ordonnancements à durées égales. QUESTIO 5(4) (1981) 219–228. Google Scholar
Chrobak, M., Dürr, C., Jawor, W., Kowalik, L. and Kurowski, M., A Note on scheduling equal-length jobs to maximize throughput. J. Sched. 9 (2006) 71–73. Google Scholar
Dauzère-Pérès, S. and Sevaux, M., An exact method to minimize the number of tardy jobs in single machine scheduling. J. Sched. 7 (2004) 405–420. Google Scholar
Erenay, F.S., Sabuncuoglu, I., Toptal, A. and Tiwari, M.K., New solution methods for single machine bicriteria scheduling problem : Minimization of average flowtime and number of tardy jobs. Eur. J. Oper. Res. 201 (2010) 89–98. Google Scholar
Erschler, J., Fontan, G., Merce, C. and Roubellat, F., A new dominance concept in scheduling n jobs on a single machine with ready times and due dates. Oper. Res. 31 (1983) 114–127. Google Scholar
M.R. Garey and D.S. Johnson, Computers and intractability, a guide to the theory of NP-completeness. W. H. Freeman and Company (1979).
Guohua, W. and Benjamin, P.-C.Y., Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs. Eur. J. Oper. Res. 195 (2009) 89–97. Google Scholar
R.M. Karp, Reducibility among combinatorial problems. in Complexity of Computer Computations, edited by R.E. Miller and J.W. Thatcher. Plenum Press, New York (1972) 85–103.
Kise, H., Toshihide, I. and Mine, H., A solvable case of the one-machine scheduling problem with ready and due times. Oper. Res. 26 (1978) 121–126. Google Scholar
E.L. Lawler, Scheduling a single machine to minimize the number of late jobs. Preprint, Computer Science Division, University of California, Berkeley (1982).
Lawler, E.L., A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Ann. Oper. Res. 26 (1990) 125–133. Google Scholar
Lee, J.Y., Kim, Y.D., Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance. Comput. Oper. Res. 39 (2012) 2196–2205. Google Scholar
Lenstra, J.K., Rinnooy Han, A.H.G. and Brucker, P., Complexity of machine scheduling problems. Ann. Discrete Math. 1 (1977) 343–362. Google Scholar
M'Hallah, R. and Bulfin, R.L., Minimizing the weighted number of tardy jobs on a single machine with release dates. Eur. J. Oper. Res. 176 (2007) 727–744. Google Scholar
M'Hallah, R., Bulfin, R.L., Minimizing the weighted number of tardy jobs on a single machine. Eur. J. Oper. Res. 145 (2003) 45–56. Google Scholar
Moore, M.J., An n job, one machine sequencing algorithm for minimizing the number of late jobs. Manag. Sci. 15(1) (1968) 102–109. Google Scholar
S. Ourari and C. Briand Conditions de dominance pour le problème à une machine avec minimisation des travaux en retard” 9ème Congrès de la Société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF’08), Clermont-Ferrand (France) 351–352 (2008).
Tuong, N.H., Soukhal, A. and Billaut, J.-C., Single-machine multi-agent scheduling problems with a global objective function. J. Sched. 15 (2011) 311–321. Google Scholar
Yedidsion, L., Shabtay, D., Korach, E. and Kaspi, M., A bicriteria approach to minimize number of tardy jobs and resource consumption in scheduling a single machine. Int. J. Product. Econom. 119 (2009) 298–307. Google Scholar