Pages that link to "Item:Q2066680"
From MaRDI portal
The following pages link to Column generation for minimizing total completion time in a parallel-batching environment (Q2066680):
Displaying 10 items.
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems (Q2093186) (← links)
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families (Q2158015) (← links)
- Exact algorithms to minimize makespan on single and parallel batch processing machines (Q2183850) (← links)
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time (Q2184132) (← links)
- When serial batch scheduling involves parallel batching decisions: a branch and price scheme (Q2669619) (← links)
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine (Q2669805) (← links)
- Distributed asynchronous column generation (Q2676290) (← links)
- Using extra dual cuts to accelerate column generation (Q2890465) (← links)
- Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches (Q6090154) (← links)
- Parallel batching with multi-size jobs and incompatible job families (Q6168657) (← links)
