Pages that link to "Item:Q1753462"
From MaRDI portal
The following pages link to Fast approximation algorithms for uniform machine scheduling with processing set restrictions (Q1753462):
Displaying 7 items.
- Fast approximation algorithms for job scheduling with processing set restrictions (Q410716) (← links)
- Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm (Q828853) (← links)
- Parallel-machine scheduling in shared manufacturing (Q2076469) (← links)
- Scheduling uniform machines with restricted assignment (Q2688627) (← links)
- Scheduling parallel machines with inclusive processing set restrictions (Q3518727) (← links)
- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times (Q5888383) (← links)
- Approximation algorithms for batch scheduling with processing set restrictions (Q6124768) (← links)