A single machine scheduling problem to minimize total early work

DOI10.1016/J.COR.2016.03.010zbMATH Open1349.90317OpenAlexW2306281376MaRDI QIDQ342425FDOQ342425

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

dynamic programmingschedulingsingle machinetotal early work

Mathematics Subject Classification ID

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

Cites Work

• 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
• Title not available (Why is that?)

Cited In (10)

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

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)