Effective optimization methods for single-machine scheduling (survey)

DOI10.1007/BF01230275MaRDI QIDQ786645zbMATH OpenFDO

Authors K. V. Shakhbazyan, N. B. Lebedinskaya

Publication date 1984

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01230275

zbMATH Keywords

joint insertionschedulingsequencingsingle machinesubstitutionsurvey of efficient algorithms

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic scheduling theory in operations research (90B35)

Cites work

• scientific article; zbMATH DE number 3642701 (Why is no real title available?)
• scientific article; zbMATH DE number 3667965 (Why is no real title available?)
• scientific article; zbMATH DE number 3691044 (Why is no real title available?)
• scientific article; zbMATH DE number 3737368 (Why is no real title available?)
• scientific article; zbMATH DE number 3520146 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 3633982 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• scientific article; zbMATH DE number 3428742 (Why is no real title available?)
• Mathematical Aspects of Scheduling Theory
• Method for optimzing functionals of permutations in the presence of constraints
• Minimization of Time-Varying Costs in Single-Machine Scheduling
• NP-complete scheduling problems
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Optimal two- and three-stage production schedules with set-up time included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
• Sequencing to Minimize the Maximum Job Cost
• Sequencing with Series-Parallel Precedence Constraints
• Single Machine Job Sequencing with Precedence Constraints
• Some simple scheduling algorithms
• The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions

Cited in

(2)

• Solution of two sequencing problems
• A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times

This page was built for publication: Effective optimization methods for single-machine scheduling (survey)

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