Pages that link to "Item:Q1029348"
From MaRDI portal
The following pages link to A note on minimizing makespan on a single batch processing machine with nonidentical job sizes (Q1029348):
Displayed 6 items.
- An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes (Q336992) (← links)
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (Q693407) (← links)
- A constraint programming approach for a batch processing problem with non-identical job sizes (Q1926887) (← links)
- Minimising makespan for two batch-processing machines with non-identical job sizes in job shop (Q2935125) (← links)
- Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes (Q5172586) (← links)
- A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines (Q5963694) (← links)