New directions in scheduling theory

DOI10.1016/0167-6377(84)90074-9zbMATH Open0528.90047OpenAlexW1986914047MaRDI QIDQ786649FDOQ786649

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)

Cites Work

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

Cited In (12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786649)