Scheduling two job classes on a single machine

DOI10.1016/0305-0548(91)90018-MzbMath0747.90050OpenAlexW2023123031MaRDI QIDQ1186919

Chris N. Potts

Publication date: 28 June 1992

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(91)90018-m

zbMATH Keywords

single machinecounterexamplesum of weighted completion times

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Unnamed Item, Batch scheduling to minimize total completion time, Batch scheduling to minimize maximum lateness, Single facility scheduling with major and minor setups, An adaptive branching rule for the permutation flow-shop problem, Range of lower bounds, Lower bounds and algorithms for flowtime minimization on a single machine with set-up times, Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times, Single machine scheduling with two job classes : minimizing maximum lateness, A heuristic approach for single-machine scheduling with due dates and class setups., Two-machine flowshop scheduling with job class setups to minimize total flowtime, Algorithms for two-machine flow-shop sequencing with precedence constraints, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems

Cites Work

• Single facility multi-class job scheduling
• Optimal schedules for single facility with two job classes
• Single facility scheduling with multiple job classes
• On the Complexity of Scheduling with Batch Setup Times
• Single-Server, Two-Machine Sequencing with Switching Time