Pages that link to "Item:Q2184132"
From MaRDI portal
The following pages link to A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time (Q2184132):
Displayed 9 items.
- Column generation for minimizing total completion time in a parallel-batching environment (Q2066680) (← links)
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems (Q2093186) (← links)
- A survey of job shop scheduling problem: the types and models (Q2146994) (← links)
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families (Q2158015) (← links)
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine (Q2669805) (← links)
- Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches (Q6090154) (← links)
- Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization (Q6167854) (← links)
- Parallel batching with multi-size jobs and incompatible job families (Q6168657) (← links)
- A best possible online algorithm for minimizing the total completion time and the total soft penalty cost (Q6181379) (← links)