Minimization of Time-Varying Costs in Single-Machine Scheduling

DOI10.1287/OPRE.26.4.563MaRDI QIDQ4166533zbMATH OpenOpenAlexFDO

Authors B. D. Sivazlian, Eugene L. Lawler

Publication date 1978

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.26.4.563

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited in

(10)

• Sequencing with general precedence constraints
• On reducing time spent in M/G/1 systems
• Optimal ordering policy of a sequencing model
• Optimal ordering rule for a stochastic sequencing model
• Optimal sequencing of inspection of dependent characteristics
• A unified view of parallel machine scheduling with interdependent processing rates
• The filtered counting process and its applications to stochastic manufacturing systems
• Effective optimization methods for single-machine scheduling (survey)
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
• Scheduling jobs on a single machine to maximize the total revenue of jobs

This page was built for publication: Minimization of Time-Varying Costs in Single-Machine Scheduling

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