Single machine scheduling problem with interval processing times and total completion time objective

DOI10.3390/a11050066zbMath1461.90057MaRDI QIDQ2283853

Natalja G. Egorova, Yuri N. Sotskov

Publication date: 13 January 2020

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a11050066

zbMATH Keywords

scheduling; single machine; total completion time; uncertain durations

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Optimality region for job permutation in single-machine scheduling with uncertain processing times, Editorial. Special issue on algorithms for scheduling problems

Cites Work

• Unnamed Item
• Single machine scheduling problem with interval processing times to minimize mean weighted completion time
• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
• On the robust single machine scheduling problem
• Single machine batch scheduling problem with resource dependent setup and processing time in the presence of fuzzy due date
• A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
• Minimizing total weighted flow time of a set of jobs with interval processing times
• Optimal fuzzy counterparts of scheduling rules
• Robust discrete optimization and its applications
• Minimizing total weighted flow time under uncertainty using dominance and a stability box
• Robust scheduling on a single machine to minimize total flow time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Dispatching rules in scheduling Dispatching rules in scheduling: a fuzzy approach
• Stability of Johnson's schedule with respect to limited machine availability
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production