Skip to main content
SpringerLink
Log in

Satisfying due-dates in large multi-factory supply chains

  • Note
  • Published:
IIE Transactions

Abstract

A procedure is developed for the simultaneous scheduling of multi-factory supply chains, including inter-factory transportation. A job-shop scheduling procedure, known to provide near-optimal solutions to industrial-sized problems, is enhanced to include transportation elements in the fundamental model. In order to demonstrate the quality of the solutions, a lower bound calculation is compared to the procedure's solutions on a number of large-scale test problems. The lower bound is an enhancement of the classic lower bound calculation for the N-job, M-machine job shop. The computational effort in scheduling is linear in the size of the problem, and high quality solutions to large-scale problems can be obtained in seconds.

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

References

  • Ahuja, R.K. and Orlin, J.B. (1994) Improved algorithms for bipartite network flow. SIAM Journal on Computing, 23(5), 906–933.

    Google Scholar 

  • Baker, K.R. and Su, Z. (1974) Sequencing with due-dates and early start times to minimize maximum tardiness. Naval Research Logistics Quarterly, 21(1), 171–176.

    Google Scholar 

  • Blazewicz, J.(1977) Simple algorithms for multiprocessor scheduling to meet deadlines. Information Processing Letters, 6(5), 162–164.

    Google Scholar 

  • Carlier, J.and Pinson, E. (1989) An algorithm for solving the job shop problem. Management Science, 35(2), 164–176.

    Google Scholar 

  • Carroll, D.C. (1965) Heuristic sequencing of single and multiple component jobs.Unpublished Ph.D. dissertation, Department of Industrial Management, MIT, Cambridge MA.

    Google Scholar 

  • Garey, M.R. and Johnson, D.S. (1977) Two-processor scheduling with start-times and deadlines. SIAM Journal of Computing, 6, 416–426.

    Google Scholar 

  • Garey, M.R., Johnson, D.S. and Sethi, R. (1976) The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1, 117–129.

    Google Scholar 

  • Hodgson, T.J., Cormier, D., Weintraub, A.J. and Zozom, A. (1998) Satisfying due-dates in large job shops. Management Science, 44(10), 1442–1446.

    Google Scholar 

  • Hodgson, T.J., King, R.E., Thoney, K.A., Stanislaw, N., Weintraub, A.J. and Zozom, A. (1999) On satisfying due-dates in large job shops: idle time insertion. IIE Transactions, 32(2), 177–180.

    Google Scholar 

  • Horn, W.A. (1974) Some simple scheduling algorithms. Naval Research Logistics Quarterly, 21(1), 177–185.

    Google Scholar 

  • Labetoulle, J., Lawler, E.L., Lenstra, J.K. and Kan, A.H.G. (1984) Preemptive scheduling of uniform machines subject to release dates, in Progress in Combinatorial Optimization, Pulleybank, W.R. (ed.), Academic Press, pp. 245–261.

  • Lawrence, S.R. and Morton, T.E. (1986) Patriarch: hierarchical production scheduling. National Bureau of Standards Special Publication, 724, 87–97.

    Google Scholar 

  • Lee, C.Y., Uzsoy, R. and Martin-Vega, L.A. (1992) Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40(4), 764–775.

    Google Scholar 

  • Lenstra, J.K., Rinnooy Kan, A.H.G. and Brucker, P. (1977) Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343–362.

    Google Scholar 

  • Neale, J.J. and Duenyas, I. (1999) Control of Manufacturing networks which contain a batch processing machine. IIE Transactions, 32(11), 1027–1041.

    Google Scholar 

  • Pinnow, A.D. (1999) Scheduling on identical parallel machines to minimize maximum lateness.Unpublished Masters thesis, Department of Industrial Engineering, North Carolina State University, Raleigh, NC 27695, USA.

    Google Scholar 

  • Thoney, K.A. (2000) Simultaneous plant and supply chain scheduling.Unpublished Ph.D. dissertation, Department of Industrial Engineering, North Carolina State University, Raleigh, NC 27695, USA.

    Google Scholar 

  • Uzsoy, R.(1995) Scheduling batch processing machine with incompatible job families. International Journal of Production Research, 33(10), 2685–2708.

    Google Scholar 

  • Vepsalainen, A.P.J. and Morton, T.E. (1988) Improving local priority rules with global lead-time estimates: a simulation study. Journal of Manufacturing and Operations Management, 1, 102–118.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Textile and Apparel, Technology and Management Department and Industrial Engineering Department, North Carolina State University, Raleigh, NC, 27695, USA

    Kristin A. Thoney

  2. Furniture Manufacturing and Management Center, Industrial Engineering Department, North Carolina State University, Raleigh, NC, 27695, USA

    Thom J. Hodgson, Russell E. King, Mehmet R. Taner & Amy D. Wilson

Authors
  1. Kristin A. Thoney
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thom J. Hodgson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Russell E. King
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mehmet R. Taner
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Amy D. Wilson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Thoney, K.A., Hodgson, T.J., King, R.E. et al. Satisfying due-dates in large multi-factory supply chains. IIE Transactions 34, 803–811 (2002). https://doi.org/10.1023/A:1015500822105

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1015500822105

Search

Navigation