Pages that link to "Item:Q2093186"
From MaRDI portal
The following pages link to An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems (Q2093186):
Displaying 4 items.
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes (Q1652033) (← 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)
- When serial batch scheduling involves parallel batching decisions: a branch and price scheme (Q2669619) (← links)
- Auction-based approach to the job-shop problem with parallel batch processing and a machine availability constraint (Q6094840) (← links)