Pages that link to "Item:Q693407"
From MaRDI portal
The following pages link to Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (Q693407):
Displaying 3 items.
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061) (← links)
- A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines (Q5963694) (← links)
