Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems

DOI10.1016/j.ejor.2022.09.032MaRDI QIDQ6106966

No author found.

Publication date: 3 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

schedulingpolynomial-time algorithmrobust optimizationshortest path problembatch scheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Optimization with uncertainties: a scheduling example

Cites Work

• Unnamed Item
• The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
• Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
• On an exact method for the constrained shortest path problem
• Batch sizing and job sequencing on a single machine
• Algorithms and complexity analysis for robust single-machine scheduling problems
• Complexity of single machine scheduling problems under scenario-based uncertainty
• Scheduling a batching machine
• The complexity of one-machine batching problems
• Robust scheduling on a single machine to minimize total flow time
• A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
• Scheduling with batching: A review
• Hybrid stochastic and robust optimization model for lot-sizing and scheduling problems under uncertainties
• A family of inequalities valid for the robust single machine scheduling polyhedron
• Complexity of minimizing the total flow time with interval data and minmax regret criterion
• Logistics scheduling with batching and transportation
• Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
• A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness
• The Price of Robustness
• Predictable scheduling of a single machine with breakdowns and sensitive jobs
• Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality
• Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times
• Models and Algorithms for Stochastic Online Scheduling
• Shortest Path Problems with Resource Constraints
• Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain

This page was built for publication: Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems