Minimization of Time-Varying Costs in Single-Machine Scheduling
From MaRDI portal
Publication:4166533
DOI10.1287/opre.26.4.563zbMath0385.90055OpenAlexW2097639731MaRDI QIDQ4166533
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
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items (10)
Optimal ordering policy of a sequencing model ⋮ Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation ⋮ Optimal ordering rule for a stochastic sequencing model ⋮ Sequencing with general precedence constraints ⋮ On reducing time spent in M/G/1 systems ⋮ Optimal sequencing of inspection of dependent characteristics ⋮ Scheduling jobs on a single machine to maximize the total revenue of jobs ⋮ The filtered counting process and its applications to stochastic manufacturing systems ⋮ A unified view of parallel machine scheduling with interdependent processing rates ⋮ Effective optimization methods for single-machine scheduling (survey)
This page was built for publication: Minimization of Time-Varying Costs in Single-Machine Scheduling
