Skip to main content
SpringerLink
Log in

Scheduling a single machine to maintain a dynamic WIP profile in coordinated manufacturing chains

  • Original Article
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This article addresses the problem of selecting and scheduling several jobs on a single machine to sustain the desired dynamic work-in-process profile. We consider sequence-dependent setup times between jobs and strictly enforced time window constraints on the start time of each job. We use working shift production targets to coordinate decentralized local schedulers and make them inline with the manufacturing chain goals. Based on the discretization of scheduling time horizon, we propose a two-step mixed-integer programming model and a new network-based heuristic. The primary objective of these approaches is to maximize the total defined score for jobs while satisfying production targets. The secondary objective is to minimize the maximum completion time of all selected jobs. The effectiveness, efficiency, and robustness of the proposed algorithms are analyzed and compared with two existing approaches over a wide range of simulated scenarios.

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.

Similar content being viewed by others

References

  1. Ahmadi RH, Bagchi U (1992) Minimizing job idleness in deadline constrained environments. Oper Res 40:972–985

    Article  MathSciNet  MATH  Google Scholar 

  2. Allahverdi A, Gupta JND, Aldowaisan T (1999) A review of scheduling research involving setup considerations. Omega 27:219–239

    Article  Google Scholar 

  3. Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187:985–1032

    Article  MathSciNet  MATH  Google Scholar 

  4. Asano M, Ohta H (1996) Single machine scheduling using dominance relation to minimize earliness subject to ready and due times. Int J Prod Econ 44:35–43

    Article  Google Scholar 

  5. Belouadah H, Posner ME, Potts CN (1992) Scheduling with release dates on a single machine to minimize total weighted completion time. Discrete Appl Math 36:213–231

    Article  MathSciNet  MATH  Google Scholar 

  6. Bianco L, Ricciardelli S (1982) Scheduling of a single machine to minimize total weighted completion time subject to release times. Nav Res Logist Q 29:151–167

    Article  MATH  Google Scholar 

  7. Chand S, Schneeberger H (1988) Single machine scheduling to minimize weighted earliness subject to no tardy jobs. Eur J Oper Res 34:221–230

    Article  MathSciNet  MATH  Google Scholar 

  8. Chou FD, Wang HM, Chang TY (2009) Algorithms for the single machine total weighted completion time scheduling problem with release times and sequence-dependent setups. Int J Adv Manuf Tech 43:810–821

    Article  Google Scholar 

  9. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, CA

    MATH  Google Scholar 

  10. Gélinas S, Soumis F (1997) A dynamic programming algorithm for single machine scheduling with ready times. Ann Oper Res 69:135–156

    Article  MATH  Google Scholar 

  11. Hariri AMA, Potts CN (1983) Algorithm for single machine sequencing with release dates to minimize total weighted completion time. Discrete Appl Math 5:99–109

    Article  MATH  Google Scholar 

  12. Jula P, Leachman RC (2008) Coordinating decentralized local schedulers in complex supply chain manufacturing. Ann Oper Res 161:123–147

    Article  MathSciNet  MATH  Google Scholar 

  13. Jula P, Leachman RC (2010) Coordinated multistage scheduling of parallel batch processing machines under multiresource constraints. Oper Res 58:933–947

    Article  MathSciNet  MATH  Google Scholar 

  14. Jula P, Rafiey A (2011) Coordinated scheduling of a single-machine with sequence dependent setup times and time window constraints. Int J Prod Res. doi:10.1080/00207543.2011.575089

    Google Scholar 

  15. Kedad-Sidhoum S, Sourd F (2010) Fast neighborhood search for the single machine earliness–tardiness scheduling problem. Comput Oper Res 37:1464–1471

    Article  MathSciNet  MATH  Google Scholar 

  16. Lenstra JK, Rinnooy K-G, Brucker P (1977) Complexity of machine scheduling problems. Ann Discrete Math 1:343–362

    Article  Google Scholar 

  17. Pan Y, Shi L (2005) Dual constrained single machine sequencing to minimize total weighted completion time. IEEE Trans Auto Sci Eng 2:344–357

    Article  Google Scholar 

  18. Posner M (1985) Minimizing weighted completion times with deadlines. Oper Res 33:562–574

    Article  MathSciNet  MATH  Google Scholar 

  19. Potts CN, Wassenhove LN (1983) Algorithm for single machine sequencing with deadlines to minimize total weighted completion time. Eur J Oper Res 12:379–387

    Article  MATH  Google Scholar 

  20. Rabadi G, Anagnostopoulos GC, Mollaghasemi M (2007) A heuristic algorithm for the just-in-time single machine scheduling problem with setups: a comparison with simulated annealing. Int J Adv Manuf Technol 32:326–335

    Article  Google Scholar 

  21. Shin HJ, Kim C-O, Kim SS (2002) A tabu search algorithm for single machine scheduling with release times, due dates, and sequence-dependent set-up times. Int J Adv Manuf Technol 19:859–866

    Article  Google Scholar 

  22. Smith WE (1956) Various optimizers for single-stage production. Nav Res Logist Q 3:59–66

    Article  Google Scholar 

  23. S̃orić K (2000) A cutting plane algorithm for a single machine scheduling problem. Eur J Oper Res 127:383–393

    Article  Google Scholar 

  24. Sourd F (2006) Dynasearch for the earliness–tardiness scheduling problem with release dates and setup constraints. Oper Res Lett 34:591–598

    Article  MathSciNet  MATH  Google Scholar 

  25. Sousa JP, Wolsey LA (1992) A time-indexed formulation of non-preemptive single-machine scheduling problems. Math Program 54:353–367

    Article  MathSciNet  MATH  Google Scholar 

  26. Van den Akker JM, van Hoesel CPM, Savelsbergh MWP (1999) A polyhedral approach to single machine scheduling problems. Math Program 85:541–572

    Article  MathSciNet  MATH  Google Scholar 

  27. Zhu XY, Wilhelm WE (2006) Scheduling and lot sizing with sequence-dependent setup: a literature review Source. IIE Trans 38:987–1007

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Beedie School of Business, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6

    Payman Jula

  2. Faculty of Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6

    Ishai Kones

Authors
  1. Payman Jula
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ishai Kones
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Payman Jula.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jula, P., Kones, I. Scheduling a single machine to maintain a dynamic WIP profile in coordinated manufacturing chains. Int J Adv Manuf Technol 59, 1167–1179 (2012). https://doi.org/10.1007/s00170-011-3554-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-011-3554-5

Keywords

Search

Navigation