Skip to main content
SpringerLink
Log in

Minimizing the makespan for a serial-batching scheduling problem with arbitrary machine breakdown and dynamic job arrival

The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Cite this article

Abstract

Many dynamic events exist in real manufacturing systems, such as arbitrary machine breakdowns and dynamic job arrivals, which makes the scheduling problem even more complicated. In this paper, we address a serial-batching scheduling problem with the above dynamic events. Jobs need to be processed on the serial-batching machines of two manufacturers and then transported by vehicles to a customer for further processing. The objective of the scheduling problem is to minimize the makespan, and the problem is proved to be strongly NP-hard. Some structural properties and a lower bound of the problem are also proved or derived. On the basis of job arrival times, we divide the problem into two phases and propose different rules regarding these two phases. Based on these properties and rules, a heuristic algorithm is developed to solve the problem and its worst case performance is analyzed. The heuristic algorithm is tested on a large set of randomly generated problem instances, and the relative gaps between the found lower bound and the solutions of the proposed heuristic algorithm are reported. The experimental results illustrate the high efficiency and effectiveness of the proposed heuristic algorithm compared with other four classic approaches.

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

Similar content being viewed by others

References

  1. Hasan SMK, Sarker R, Essam D (2011) Genetic algorithm for job-shop scheduling with machine unavailability and breakdowns. Int J Prod Res 49(16):4999–5015

    Article  Google Scholar 

  2. Wang K, Choi SH (2012) A decomposition-based approach to flexible flow shop scheduling under machine breakdown. Int J Prod Res 50(1):215–234

    Article  MathSciNet  Google Scholar 

  3. Benmansour R, Allaoui H, Artiba A (2012) Stochastic single machine scheduling with random common due date. Int J Prod Res 50(13):3560–3571

    Article  Google Scholar 

  4. Lee JY, Kim YD (2012) Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance. Comput Oper Res 39(9):2196–2205

    Article  MathSciNet  MATH  Google Scholar 

  5. Mirabi M, Fatemi Ghomi SMT, Jolai F (2013) A two-stage hybrid flowshop scheduling problem in machine breakdown condition. J Intell Manuf 24(1):193–199

    Article  Google Scholar 

  6. Xiong J, Xing LN, Chen YW (2013) Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns. Int J Prod Econ 141(1):112–126

    Article  Google Scholar 

  7. Zandieha M, Adibi MA (2010) Dynamic job shop scheduling using variable neighbourhood search. Int J Prod Res 48(8):2449–2458

    Article  MATH  Google Scholar 

  8. Lee ZJ, Lin SW, Ying KC (2010) Scheduling jobs on dynamic parallel machines with sequence-dependent setup times. Int J Adv Manuf Technol 47(5–8):773–781

    Article  Google Scholar 

  9. Chiang TC, Cheng HC, Fu LC (2010) A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival. Comput Oper Res 37(12):2257–2269

    Article  MathSciNet  MATH  Google Scholar 

  10. Yao S, Jiang Z, Li N (2012) A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals. Comput Oper Res 39(5):939–951

    Article  MathSciNet  MATH  Google Scholar 

  11. Yao FS, Zhao M, Zhang H (2012) Two-stage hybrid flow shop scheduling with dynamic job arrivals. Comput Oper Res 39(7):1701–1712

    Article  MathSciNet  MATH  Google Scholar 

  12. Lu MS, Romanowski R (2012) Multi-contextual ant colony optimization of intermediate dynamic job shop problems. Int J Adv Manuf Technol 60(5–8):667–681

    Article  Google Scholar 

  13. Anglani A, Grieco A, Guerriero E, Musmanno R (2005) Robust scheduling of parallel machines with sequence-dependent set-up costs. Eur J Oper Res 161(3):704–720

    Article  MathSciNet  MATH  Google Scholar 

  14. Quadt D, Kuhn H (2005) Conceptual framework for lot-sizing and scheduling of flexible flow lines. Int J Prod Res 43(11):2291–2308

    Article  MATH  Google Scholar 

  15. Ciavotta M, Detti P, Meloni C, Pranzo M (2008) A bi-objective coordination setup problem in a two-stage production system. Eur J Oper Res 189(3):734–745

    Article  MATH  Google Scholar 

  16. Roshanaei V, Naderi B, Jolai F, Khalili M (2009) A variable neighborhood search for job shop scheduling with set-up times to minimize makespan. Futur Gener Comput Syst 25(6):654–661

    Article  Google Scholar 

  17. Shahvari O, Salmasi N, Logendran R, Abbasi B (2012) An efficient tabu search algorithm for flexible flow shop sequence-dependent group scheduling problems. Int J Prod Res 50(15):4237–4254

    Article  Google Scholar 

  18. Varmazyar M, Salmasi N (2012) Sequence-dependent flow shop scheduling problem minimising the number of tardy jobs. Int J Prod Res 50(20):5843–5858

    Article  Google Scholar 

  19. Thurer M, Silva C, Stevenson M, Land M (2012) Improving the applicability of workload control (WLC): the influence of sequence-dependent set-up times on workload controlled job shops. Int J Prod Res 50(22):6419–6430

    Article  Google Scholar 

  20. Nagano MS, Silva AA, Lorena LAN (2012) A new evolutionary clustering search for a no-wait flow shop problem with set-up times. Eng Appl Artif Intell 25(6):1114–1120

    Article  Google Scholar 

  21. Chakaravarthy GV, Marimuthu S, Sait AN (2013) Performance evaluation of proposed Differential Evolution and Particle Swarm Optimization algorithms for scheduling m-machine flow shops with lot streaming. J Intell Manuf 24(1):175–191

    Article  Google Scholar 

  22. Hall NG, Potts CN (2003) Supply chain scheduling: batching and delivery. Oper Res 51(4):566–584

    Article  MathSciNet  MATH  Google Scholar 

  23. Geunes J., and Pardalos P.M. (2003). Supply chain optimization. Kluwer Academic Publishers

  24. Su CS, Panb JCH, Hsua TS (2009) A new heuristic algorithm for the machine scheduling problem with job delivery coordination. Theor Comput Sci 410(27–29):2581–2591

    Article  MathSciNet  Google Scholar 

  25. Delavar MR, Hajiaghaei-Keshteli M, Molla-Alizadeh-Zavardehi S (2010) Genetic algorithms for coordinated scheduling of production and air transportation. Expert Syst Appl 37(12):8255–8266

    Article  Google Scholar 

  26. Bard JF, Nananukul N (2010) A branch-and-price algorithm for an integrated production and inventory routing problem. Comput Oper Res 37(12):2202–2217

    Article  MathSciNet  MATH  Google Scholar 

  27. Steinruecke M (2011) An approach to integrate production-transportation planning and scheduling in an aluminium supply chain network. Int J Prod Res 49(21):6559–6583

    Article  Google Scholar 

  28. You PS, Hsieh YC (2012) A heuristic approach to a single stage assembly problem with transportation allocation. Appl Math Comput 218(22):11100–11111

    Article  MathSciNet  MATH  Google Scholar 

  29. Cakici E, Mason SJ, Kurz ME (2012) Multi-objective analysis of integrated an supply chain scheduling problem. Int J Prod Res 50(10):2624–2638

    Article  Google Scholar 

  30. Ng CT, Cheng TCE, Yuan JJ, Liu ZH (2003) On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. Oper Res Lett 31(4):323–326

    Article  MathSciNet  MATH  Google Scholar 

  31. Yuan JJ, Lin YX, Cheng TCE, Ng CT (2007) Single machine serial-batching scheduling problem with a common batch size to minimize total weighted completion time. Int J Prod Econ 105(2):402–406

    Article  Google Scholar 

  32. Pei J, Liu X, Pardalos PM, Fan W, Yang S, Wang L (2014) Application of an effective modified gravitational search algorithm for the coordinated scheduling problem in a two-stage supply chain. Int J Adv Manuf Technol 70(1–4):335–348

    Article  Google Scholar 

  33. Pei J, Liu X, Pardalos PM, Fan W, Yang S (2015) Single machine serial-batching scheduling with independent setup time and deteriorating job processing times. Optim Lett 9(1):91–104

    Article  MathSciNet  MATH  Google Scholar 

  34. Pei J, Pardalos PM, Liu X, Fan W, Yang S (2015) Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan. Eur J Oper Res 244(1):13–25

    Article  MathSciNet  Google Scholar 

  35. Tang L, Guan J, Hu G (2010) Steelmaking and refining coordinated scheduling problem with waiting time and transportation consideration. Comput Ind Eng 58(8):239–248

    Article  Google Scholar 

  36. Gong H, Tang L (2011) Two-machine flowshop scheduling with intermediate transportation under job physical space consideration. Comput Oper Res 38(9):1267–1274

    Article  MathSciNet  MATH  Google Scholar 

  37. Tang L, Gong H, Liu J, Li F (2014) Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations. Nav Res Logist 61(4):269–285

    Article  MathSciNet  Google Scholar 

  38. Xuan H, Tang L (2007) Scheduling a hybrid flowshop with batch production at the last stage. Comput Oper Res 34(9):2718–2733

    Article  MATH  Google Scholar 

  39. Holthaus O (1999) Scheduling in job shops with machine breakdowns: an experimental study. Comput Ind Eng 36(1):137–162

    Article  Google Scholar 

  40. Dominic PDD, Kaliyamoorthy S, Kumar M (2004) Efficient dispatching rules for dynamic job shop scheduling. Int J Adv Manuf Technol 24(1–2):70–75

    Google Scholar 

  41. Zandieh M, Adibi MA (2010) Dynamic job shop scheduling using variable neighbourhood search. Int J Prod Res 48(8):2449–2458

    Article  MATH  Google Scholar 

  42. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic machine scheduling: a survey. Ann Discret Math 5:287–326

    Article  MathSciNet  MATH  Google Scholar 

  43. Chou FD, Chang PC, Wang HM (2006) A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem. Int J Adv Manuf Technol 31(3–4):350–359

    Article  Google Scholar 

  44. Mirsanei HS, Karimi B, Jolai F (2009) Flow shop scheduling with two batch processing machines and nonidentical job sizes. Int J Adv Manuf Technol 45(5–6):553–572

    Article  Google Scholar 

  45. Tang L, Liu P (2009) Minimizing makespan in a two-machine flowshop scheduling with batching and release time. Math Comput Model 49(5–6):1071–1077

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Management, Hefei University of Technology, Hefei, China

    Jun Pei, Xinbao Liu, Wenjuan Fan & Shanlin Yang

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA

    Jun Pei & Panos M. Pardalos

  3. Key Laboratory of Process Optimization and Intelligent Decision-making of Ministry of Education, Hefei, China

    Jun Pei, Xinbao Liu & Shanlin Yang

  4. Department of Computer Science, North Carolina State University, Raleigh, USA

    Wenjuan Fan

  5. Division of Industrial Logistics, Department of Industrial Engineering, Lulea University of Technology, Sweden & Division of Transportation, Construction Management and Regional Planning, Department of Civil Engineering, Aristotle University of Thessaloniki, Thessaloniki, Greece

    Athanasios Migdalas

  6. Department of Industrial Engineering, Russ College of Engineering and Technology, Ohio University, Athens, Ohio, USA

    Boris Goldengorin

Authors
  1. Jun Pei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xinbao Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wenjuan Fan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Athanasios Migdalas
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Boris Goldengorin
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Shanlin Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xinbao Liu.

Rights and permissions

Reprints and Permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pei, J., Liu, X., Fan, W. et al. Minimizing the makespan for a serial-batching scheduling problem with arbitrary machine breakdown and dynamic job arrival. Int J Adv Manuf Technol 86, 3315–3331 (2016). https://doi.org/10.1007/s00170-016-8408-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-016-8408-8

Keywords

search

Navigation