Basic Scheduling Problems with Raw Material Constraints

One of the achievements of scheduling theory is its contribution to practical applications in industrial settings. In particular, taking finiteness of the available production capacity explicitly into account, has been a major improvement of standard practice. Availability of raw materials, however, which is another important constraint in practice, has been largely disregarded in scheduling theory. This paper considers basic models for scheduling problems in contemporary manufacturing settings where raw material availability is of critical importance. We explore single scheduling machine problems, mostly with unit or all equal processing times, and Lmax and Cmax objectives. We present polynomial time algorithms, complexity and approximation results, and computational experiments. © 2005 Wiley Periodicals, Inc. Naval Research Logistics 52: 527-535, 2005.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Wieslaw Kubiak,et al.  Optimal level schedules for mixed-model, multi-level just-in-time assembly systems , 1997, Ann. Oper. Res..

[3]  Monaldo Mastrolilli,et al.  Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times , 2003, J. Sched..

[4]  J. Miltenberg,et al.  Level schedules for mixed-model assembly lines in just-in-time production systems , 1989 .

[5]  A. Grigoriev,et al.  High multiplicity scheduling problems , 2003 .

[6]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[7]  Richard B. Chase,et al.  Operations Management , 2019, CCSP (ISC)2 Certified Cloud Security Professional Official Study Guide, 2nd Edition.

[8]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[9]  Philippe Laborie,et al.  Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results , 2003, Artif. Intell..

[10]  Gerald Heisig,et al.  Planning Stability in Material Requirements Planning Systems , 2002 .

[11]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[12]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[13]  G. Schmidt.  Scheduling under resource constraints — Deterministic models , 1987 .

[14]  S. Engell,et al.  Planning and Scheduling in the Process Industry , 2022 .

[15]  W. A. Horn.  Some simple scheduling algorithms , 1974 .

[16]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[17]  Chelliah Sriskandarajah,et al.  An efficient algorithm for a job shop problem , 1995, Ann. Oper. Res..

[18]  Barbara B. Simons,et al.  A fast algorithm for single processor scheduling , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[19]  Jan Karel Lenstra,et al.  Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints , 1983, Oper. Res..

[20]  Jacek Blazewicz,et al.  Scheduling under resource constraints - deterministic models , 1986 .