Pages that link to "Item:Q2189876"
From MaRDI portal
The following pages link to Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling (Q2189876):
Displaying 12 items.
- Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
- Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut (Q2030502) (← links)
- A matheuristic for the generalized order acceptance and scheduling problem (Q2077965) (← links)
- Order assignment and scheduling under processing and distribution time uncertainty (Q2083940) (← links)
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times (Q2140270) (← links)
- Branch-and-check approaches for the tourist trip design problem with rich constraints (Q2669676) (← links)
- On the mass COVID-19 vaccination scheduling problem (Q2669767) (← links)
- Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date (Q2676340) (← links)
- Unrelated parallel machine scheduling problem with special controllable processing times and setups (Q2676390) (← links)
- Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition (Q5084654) (← links)
- Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem (Q5086007) (← links)
- Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut (Q6096622) (← links)
