Skip to main content
SpringerLink
Log in

A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint

  • General Paper
  • Published:
Journal of the Operational Research Society

Abstract

This research focuses on the problem of scheduling jobs on two identical parallel machines that are not continuously available with the objective of minimizing total tardiness. After processing a given number of jobs, each machine requires a preventive maintenance task, during which the machine cannot process jobs. We present dominance properties and lower bounds, and develop a branch and bound algorithm using these properties and lower bounds as well as an upper bound obtained from a heuristic algorithm. Performance of the algorithm is evaluated through a series of computational experiments on randomly generated instances and results are reported.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5

Similar content being viewed by others

References

  • Adiri I, Bruno J, Frostig E and Rinnooy-Kan AHG (1989). Single machine flow-time scheduling with a single breakdown. Acta Informatica 26 (7): 679–696.

    Article  Google Scholar 

  • Adiri I, Frostig E and Rinnooy-Kan AHG (1991). Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs. Naval Research Logistics 38 (2): 261–271.

    Article  Google Scholar 

  • Akturk MS, Ghosh JB and Gunes ED (2003). Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance. Naval Research Logistics 50 (1): 15–30.

    Article  Google Scholar 

  • Akturk MS, Ghosh JB and Gunes ED (2004). Scheduling with tool changes to minimize total completion time: Basic results and SPT performance. European Journal of Operational Research 157 (3): 784–790.

    Article  Google Scholar 

  • Azizoglu M and Kirca O (1998). Tardiness minimization on parallel machines. International Journal of Production Economics 55 (2): 163–168.

    Article  Google Scholar 

  • Baker KR (1974). Introduction to Sequencing and Scheduling. Wiley: New York.

    Google Scholar 

  • Birge J, Frenk JBG, Mittenthal J and Rinnooy-Kan AHG (1990). Single-machine scheduling subject to stochastic breakdowns. Naval Research Logistics 37 (5): 661–677.

    Article  Google Scholar 

  • Chen JS (2006a). Single-machine scheduling with flexible and periodic maintenance. Journal of the Operational Research Society 57 (6): 703–710.

    Article  Google Scholar 

  • Chen WJ (2006b). Minimizing total flow time in the single-machine scheduling problem with periodic maintenance. Journal of the Operational Research Society 57 (4): 410–415.

    Article  Google Scholar 

  • Chen JS (2008). Optimization models for the tool change scheduling problem. Omega 36 (5): 888–894.

    Article  Google Scholar 

  • Chen WJ (2009). Minimizing number of tardy jobs on a single machine subject to periodic maintenance. Omega 37 (3): 591–599.

    Article  Google Scholar 

  • Choi YC and Kim YD (2001). Tool replacement policies for a machining center producing multiple types of products with distinct due dates. International Journal of Production Research 39 (5): 907–921.

    Article  Google Scholar 

  • Chu C (1992). A branch and bound algorithm to minimize total tardiness with different release dates. Naval Research Logistics 39 (2): 265–283.

    Article  Google Scholar 

  • Das K, Lashkari RS and Sengupta S (2008). Integrating machine reliability and preventive maintenance planning in manufacturing cell design. Industrial Engineering and Management Systems 7 (2): 114–125.

    Google Scholar 

  • Dell’Amico M and Martello S (2001). Bounds for the cardinality constrained P∣∣Cmax problem. Journal of Scheduling 4 (3): 123–138.

    Article  Google Scholar 

  • Du J and Leung JYT (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15 (3): 483–495.

    Article  Google Scholar 

  • Ecker KH and Gupta JND (2005). Scheduling tasks on a flexible manufacturing machine to minimize tool change delays. European Journal of Operational Research 164 (3): 627–638.

    Article  Google Scholar 

  • Frostig E (1991). A note on stochastic scheduling on a single machine subject to breakdown—the preemptive repeat model. Probability in the Engineering and Information Sciences 5 (3): 349–354.

    Article  Google Scholar 

  • Gharbi A and Haouari M (2005). Optimal parallel machines scheduling with availability constraints. Discrete Applied Mathematics 148 (1): 63–87.

    Article  Google Scholar 

  • Graham RL, Lawler EL, Lenstra JK and Rinnooy-Kan AHG (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5: 287–326.

    Article  Google Scholar 

  • Ho JC and Wong JS (1995). Makespan minimization for m parallel identical processors. Naval Research Logistics 42 (6): 935–948.

    Article  Google Scholar 

  • Hong SS, Park JH and Lie CH (2010). Optimal preventive maintenance policy with cost-dependent improvement factor. Journal of the Korean Institute of Industrial Engineers 36 (2): 108–116.

    Google Scholar 

  • Hsu CJ, Low C and Su CT (2010). A single-machine scheduling problem with maintenance activities to minimize makespan. Applied Mathematics and Computation 215 (11): 3929–3935.

    Article  Google Scholar 

  • Kim YD (1995). Minimizing total tardiness in permutation flowshops. European Journal of Operational Research 85 (3): 541–555.

    Article  Google Scholar 

  • Kondakci S, Azizoglu M and Kirca O (1994). An efficient algorithm for the single machine tardiness problem. International Journal of Production Economics 36 (2): 213–219.

    Article  Google Scholar 

  • Koulamas C (1997). Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem. Naval Research Logistics 44 (1): 109–125.

    Article  Google Scholar 

  • Lee CY (1996). Machine scheduling with an availability constraint. Journal of Global Optimization 9 (3–4): 395–416.

    Article  Google Scholar 

  • Lee CY and Chen ZL (2000). Scheduling jobs and maintenance activities on parallel machines. Naval Research Logistics 47 (2): 145–165.

    Article  Google Scholar 

  • Lee CY and Liman SD (1993). Capacitated two-parallel machines scheduling to minimize sum of job completion times. Discrete Applied Mathematics 41 (3): 211–222.

    Article  Google Scholar 

  • Lee H, Park YJ and Hur S (2012). A preventive maintenance scheduling model of the cluster tool. IE Interfaces 25 (1): 127–133.

    Article  Google Scholar 

  • Lee JY and Kim YD (2012). Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance. Computers and Operations Research 39 (9): 2196–2205.

    Article  Google Scholar 

  • Lee SH and Lee IG (2008). Heuristic algorithm for the single machine scheduling with periodic maintenance. Journal of the Korean Institute of Industrial Engineers 34 (3): 318–327.

    Google Scholar 

  • Lenstra JK, Rinnooy-Kan AHG and Brucker P (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics 1: 343–362.

    Article  Google Scholar 

  • Levin A, Mosheiov G and Sarig A (2009). Scheduling a maintenance activity on parallel identical machines. Naval Research Logistics 56 (1): 33–41.

    Article  Google Scholar 

  • Liao CJ and Chen WJ (2003). Single-machine scheduling with periodic maintenance and nonresumable jobs. Computers and Operations Research 30 (9): 1335–1347.

    Article  Google Scholar 

  • Liao CJ, Chen CM and Lin CH (2007). Minimizing makespan for two parallel machines with job limit on each availability interval. Journal of the Operational Research Society 58 (7): 938–947.

    Article  Google Scholar 

  • Liao CJ, Shyur DL and Lin CH (2005). Makespan minimization for two parallel machines with an availability constraint. European Journal of Operational Research 160 (2): 445–456.

    Article  Google Scholar 

  • Lin CH and Liao CJ (2007). Makespan minimization for two parallel machines with an unavailable period on each machine. International Journal of Advanced Manufacturing Technology 33 (9–10): 1024–1030.

    Article  Google Scholar 

  • Mellouli R, Sadfi C, Chu C and Kacem I (2009). Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times. European Journal of Operational Research 197 (3): 1150–1165.

    Article  Google Scholar 

  • Pinedo M and Rammouz E (1988). A note on stochastic scheduling on a single machine subject to breakdown and repair. Probability in the Engineering and Information Sciences 2 (1): 41–49.

    Article  Google Scholar 

  • Potts CN and Van Wassenhove LN (1985). A branch and bound algorithm for the total weighted tardiness problem. Operations Research 33 (2): 363–377.

    Article  Google Scholar 

  • Qi X, Chen T and Tu F (1999). Scheduling the maintenance on a single machine. Journal of the Operational Research Society 50 (10): 1071–1078.

    Article  Google Scholar 

  • Rachamadugu RMV (1987). A note on the weighted tardiness problem. Operations Research 35 (3): 450–452.

    Article  Google Scholar 

  • Schaller J (2009). Note on Shim and Kim’s lower bounds for scheduling on identical parallel machines to minimize total tardiness. European Journal of Operational Research 197 (1): 422–426.

    Article  Google Scholar 

  • Shim SO and Kim YD (2007). Scheduling on parallel identical machines to minimize total tardiness. European Journal of Operational Research 177 (1): 135–146.

    Article  Google Scholar 

  • Tanaka S and Araki M (2008). A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines. International Journal of Production Economics 113 (1): 446–458.

    Article  Google Scholar 

  • Wang JJ, Wang JB and Liu F (2011). Parallel machines scheduling with a deteriorating maintenance activity. Journal of the Operational Research Society 62 (10): 1898–1902.

    Article  Google Scholar 

  • Xu D, Sun K and Li H (2008). Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan. Computers and Operations Research 35 (4): 1344–1349.

    Article  Google Scholar 

  • Yalaoui F and Chu C (2002). Parallel machine scheduling to minimize total tardiness. International Journal of Production Economics 76 (3): 265–279.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea

    Ju-Yong Lee & Yeong-Dae Kim

Authors
  1. Ju-Yong Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yeong-Dae Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yeong-Dae Kim.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lee, JY., Kim, YD. A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint. J Oper Res Soc 66, 1542–1554 (2015). https://doi.org/10.1057/jors.2014.122

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.2014.122

Keywords

Search

Navigation