Pages that link to "Item:Q2433392"
From MaRDI portal
The following pages link to An approximate decomposition algorithm for scheduling on parallel machines with heads and tails (Q2433392):
Displayed 6 items.
- Bounding strategies for the hybrid flow shop scheduling problem (Q545969) (← links)
- A simulated annealing approach to minimize the maximum lateness on uniform parallel machines (Q552090) (← links)
- Energetic reasoning revisited: Application to parallel machine scheduling (Q835610) (← links)
- Search tree based approaches for parallel machine scheduling (Q941538) (← links)
- A local and global search combine particle swarm optimization algorithm for job-shop scheduling to minimize makespan (Q1958785) (← links)
- A prediction based iterative decomposition algorithm for scheduling large-scale job shops (Q2473277) (← links)