assessment of new developmentsjobsmachinesprobabilistic analysis of scheduling algorithmsreviewsequencing
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic scheduling theory in operations research (90B35)
Cites work
- Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems
- Computer-Aided complexity classification of combinational problems
- scientific article; zbMATH DE number 3883928 (Why is no real title available?)
- scientific article; zbMATH DE number 3873052 (Why is no real title available?)
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- scientific article; zbMATH DE number 4099020 (Why is no real title available?)
- scientific article; zbMATH DE number 4099043 (Why is no real title available?)
- scientific article; zbMATH DE number 3708086 (Why is no real title available?)
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- scientific article; zbMATH DE number 3757695 (Why is no real title available?)
- scientific article; zbMATH DE number 3780551 (Why is no real title available?)
- scientific article; zbMATH DE number 3780553 (Why is no real title available?)
- scientific article; zbMATH DE number 3786125 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- scientific article; zbMATH DE number 3561065 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- Minimizing maximum lateness on one machine: computational experience and some applications
- Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
- On the facial structure of scheduling polyhedra
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Preemptive Scheduling with Release Times, Deadlines, and Due Times
- Probabilistic Analysis of a Machine Scheduling Problem
- Scheduling subject to resource constraints: Classification and complexity
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
- Stochastic scheduling problems I — General strategies
- Stochastic scheduling problems II-set strategies-
- Surrogate duality relaxation for job shop scheduling
- The Asymptotic Optimality of the LPT Rule
- The NP-completeness column: An ongoing guide
- The one-machine sequencing problem
- The Three-Machine No-Wait Flow Shop is NP-Complete
Cited in
(12)- A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems
- New trends in machine scheduling
- Real-time scheduling of an automated manufacturing center
- The complexity of scheduling jobs in repetitive manufacturing systems
- Integration of lotsizing and scheduling decisions in a job-shop
- Structure of a simple scheduling polyhedron
- Scheduling the two-machine open shop problem under resource constraints for setting the jobs
- Flowshop sequencing problems with limited buffer storage
- Two level heuristic for the resource constrained scheduling problem
- Scheduling unit-time tasks in renewable resource constrained flowshops
- A new method for workshop real time scheduling
- A state-of-the-art review of parallel-machine scheduling research
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)
