A single machine scheduling problem to minimize total early work

DOI10.1016/j.cor.2016.03.010zbMath1349.90317OpenAlexW2306281376MaRDI QIDQ342425

Gur Mosheiov, Yoav Ben-Yehoshua

Publication date: 17 November 2016

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

Full work available at URL: https://doi.org/10.1016/j.cor.2016.03.010

zbMATH Keywords

schedulingdynamic programmingsingle machinetotal early work

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work ⋮ A no-delay single machine scheduling problem to minimize total weighted early and late work ⋮ Variable neighborhood search for the single machine scheduling problem to minimize the total early work ⋮ Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach ⋮ Minimizing total late work on a single machine with generalized due-dates ⋮ Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date ⋮ Mirror scheduling problems with early work and late work criteria ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems

Cites Work

• Unnamed Item
• Minimizing the number of tardy job units under release time constraints
• THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
• Single Machine Scheduling to Minimize Total Late Work