JUST-IN-TIME SCHEDULING UNDER SCENARIO-BASED UNCERTAINTY

DOI10.1142/S0217595912500558zbMath1267.90048OpenAlexW2031621633MaRDI QIDQ2836525

Dae-Young Chung, Byung-Cheon Choi

Publication date: 3 July 2013

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595912500558

zbMATH Keywords

uncertaintycomputational complexityschedulingFPTASjust in time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A state-of-the-art survey on multi-scenario scheduling

Cites Work

• Minimizing the number of late jobs on a single machine under due date uncertainty
• On the robust single machine scheduling problem
• Approximation of min-max and min-max regret versions of some combinatorial optimization problems
• Complexity of single machine scheduling problems under scenario-based uncertainty
• A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Single machine scheduling to minimize the number of early and tardy jobs
• Faster algorithms for the shortest path problem
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production

This page was built for publication: JUST-IN-TIME SCHEDULING UNDER SCENARIO-BASED UNCERTAINTY