New directions in scheduling theory

DOI10.1016/0167-6377(84)90074-9zbMath0528.90047OpenAlexW1986914047MaRDI QIDQ786649

Jan Karel Lenstra, Alexander H. G. Rinnooy Kan

Publication date: 1984

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/6531

zbMATH Keywords

sequencingreviewmachinesassessment of new developmentsjobsprobabilistic analysis of scheduling algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (12)

Integration of lotsizing and scheduling decisions in a job-shop ⋮ A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems ⋮ Two level heuristic for the resource constrained scheduling problem ⋮ New trends in machine scheduling ⋮ Real-time scheduling of an automated manufacturing center ⋮ Flowshop sequencing problems with limited buffer storage ⋮ Scheduling unit-time tasks in renewable resource constrained flowshops ⋮ A state-of-the-art review of parallel-machine scheduling research ⋮ Scheduling the two-machine open shop problem under resource constraints for setting the jobs ⋮ Structure of a simple scheduling polyhedron ⋮ A new method for workshop real time scheduling ⋮ The complexity of scheduling jobs in repetitive manufacturing systems

Cites Work

• Scheduling subject to resource constraints: Classification and complexity
• The one-machine sequencing problem
• Surrogate duality relaxation for job shop scheduling
• Stochastic scheduling problems I — General strategies
• Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems
• Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
• Probabilistic Analysis of a Machine Scheduling Problem
• Stochastic scheduling problems II-set strategies-
• On the facial structure of scheduling polyhedra
• The Three-Machine No-Wait Flow Shop is NP-Complete
• The Asymptotic Optimality of the LPT Rule
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
• Preemptive Scheduling with Release Times, Deadlines, and Due Times
• Computer-Aided complexity classification of combinational problems
• Minimizing maximum lateness on one machine: computational experience and some applications
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The NP-completeness column: An ongoing guide
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New directions in scheduling theory