A single machine scheduling problem to minimize total early work

DOI10.1016/J.COR.2016.03.010MaRDI QIDQ342425zbMATHOpenAlexFDO

Authors Yoav Ben-Yehoshua, Gur Mosheiov

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

dynamic programmingschedulingsingle machinetotal early work

Mathematics Subject Classification ID

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

Recommendations

• Single machine scheduling problem with minimize total weighted early work
• Single Machine Scheduling to Minimize Total Late Work
• Single machine scheduling to minimize the number of early and tardy jobs
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Two-agent single machine scheduling problem with the total weighted early work

Cites work

• scientific article; zbMATH DE number 3902030 (Why is no real title available?)
• Minimizing the number of tardy job units under release time constraints
• Single Machine Scheduling to Minimize Total Late Work
• THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE

Cited in

(13)

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

This page was built for publication: A single machine scheduling problem to minimize total early work

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