86
Views
26
CrossRef citations to date
0
Altmetric
TECHNICAL NOTE

Satisfying due-dates in large multi-factory supply chains

, , , &
Pages 803-811 | Received 01 Oct 2000, Accepted 01 Dec 2001, Published online: 17 Apr 2007

References

  • Ahuja , R. K. and Orlin , J. B. ( 1994 ) Improved algoithms for bipartite network flow. SIAM Journal on Computing , 23 ( 5 ), 906 – 933 .
  • 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 .
  • Blazcwicz , J. ( 1977 ) Simple algorithms for multiprocessor scheduling to meet deadlines. Information Processing Letters , 6 ( 5 ), 162 – 164 .
  • Cartier . J. and Pinson , E. ( 1989 ) An algorithm for solving the job shop problem. Management Science , 35 ( 2 ), 164 – 176 .
  • Carroll , D. C. ( 1965 ) Heuristie sequencing of single and multiple component jobs. , Unpublished Ph.D. dissertation, Department of Industrial Management, MIT, Cambridge s :MA.
  • Garey , M. R. and Johnson , D. S. ( 1977 ) Two-processor scheduling with start-times and deadlines. SIAM Journal of Computing , 6 , 416 – 426 .
  • Garey , M. R. Johnson , D. S. and Sethi , R. ( 1976 ) The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research , 1 . 117 – 129 .
  • 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 .
  • 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 .
  • Horn , W. A. ( 1974 ) Some simple scheduling algorithms. Naval Research Logistics Quarterly , 21 ( 1 ), 177 – 185 .
  • Labetoulle , J. , Lawler . E. L. , Lenstra , J. K. and Kan , A. H. G. ( 1984 ) Preemptive scheduling of uniform machines subject to release dales, 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 .
  • 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 .
  • Lenstra , J. K , Rinnooy Kan , A. H. G. and Brucker . P. ( 1977 ) Complexity of machine scheduling problems. Annals of Discrete Mathematics , 1 , 343 – 362 .
  • Neale . J. J. and Duenyas , I. ( 1999 ) Control of Manufacturing networks which contain a batch processing machine. IIE Transactions , 32 ( 11 ), 1027 – 1041 .
  • 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 .
  • 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 .
  • Uzsoy , R. ( 1995 ) Scheduling batch processing machine with incompatible job families. International Journal of Production Research , 33 ( 10 ), 2685 – 2708 .
  • 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 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.