Basic scheduling problems with raw material constraints
- 16 June 2005
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 52 (6) , 527-535
Abstract
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, 2005.Keywords
This publication has 10 references indexed in Scilit:
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new resultsArtificial Intelligence, 2003
- Planning and scheduling in the process industryOR Spectrum, 2002
- Scheduling Algorithms2001
- An efficient algorithm for a job shop problemAnnals of Operations Research, 1995
- Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production SystemsManagement Science, 1989
- Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence ConstraintsOperations Research, 1983
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- A fast algorithm for single processor scheduling1978
- Some simple scheduling algorithmsNaval Research Logistics Quarterly, 1974
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954