Order assignment and scheduling under processing and distribution time uncertainty
From MaRDI portal
Publication:2083940
DOI10.1016/j.ejor.2022.05.033OpenAlexW4280593020MaRDI QIDQ2083940
Chuang Zhang, Shuai Zhang, Jean-François Côté, Yantong Li, Leandro C. Coelho
Publication date: 17 October 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.05.033
stochastic optimizationmakespantardinesslogic-based benders decompositionorder assignment and scheduling
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost
- A sample average approximation method for disassembly line balancing problem under uncertainty
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
- Single-machine scheduling with release times and tails
- A roadmap for higher research quality in Humanitarian operations: a methodological perspective
- Integrated methods for optimization.
- Scheduling on parallel identical machines to minimize total tardiness
- Logic-based Benders decomposition
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
- A knowledge-based approach for multi-factory production systems
- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
- Single machine scheduling to minimize total weighted tardiness
- Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
- An exact algorithm for the precedence-constrained single-machine scheduling problem
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- Decomposition Methods for the Parallel Machine Scheduling Problem with Setups
- Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
- Combinatorial Benders' Cuts for the Strip Packing Problem
- A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines
- Order Assignment and Scheduling in a Supply Chain
- Planning and Scheduling by Logic-Based Benders Decomposition
- A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair
- Stochastic Planning and Scheduling with Logic-Based Benders Decomposition
- Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- A memetic algorithm for the total tardiness single machine scheduling problem
