Pages that link to "Item:Q2140270"
From MaRDI portal
The following pages link to Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times (Q2140270):
Displaying 13 items.
- Robust scheduling of parallel machines with sequence-dependent set-up costs (Q706962) (← links)
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times (Q853028) (← links)
- A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach (Q1699353) (← links)
- Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm (Q1725624) (← links)
- Two branch-and-bound algorithms for the robust parallel machine scheduling problem (Q1762154) (← links)
- Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints (Q2434297) (← links)
- The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times (Q2664350) (← links)
- A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production (Q2669527) (← links)
- A robust optimization approach for the unrelated parallel machine scheduling problem (Q2701168) (← links)
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms (Q5060784) (← links)
- An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems (Q5139849) (← links)
- An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date (Q6149341) (← links)
- Scheduling identical serial-batching machines in the engine manufacturing supply chain by an integrated variable neighborhood search Algorithm (Q6551161) (← links)
