Pages that link to "Item:Q300962"
From MaRDI portal
The following pages link to Comparing the minimum completion times of two longest-first scheduling-heuristics (Q300962):
Displaying 4 items.
- A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines (Q342416) (← links)
- Reducing ergonomic risks by job rotation scheduling (Q2393126) (← links)
- Improved approaches to the exact solution of the machine covering problem (Q2398644) (← links)
- Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance (Q4456055) (← links)