An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines
From MaRDI portal
Publication:5696463
Recommendations
- Heuristics for scheduling unrelated parallel machines
- A unified approach to scheduling on unrelated parallel machines
- Improved approximation schemes for scheduling unrelated parallel machines
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- Some Heuristics for Scheduling Jobs on Parallel Machines with Setups
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
Cites work
- A state-of-the-art review of parallel-machine scheduling research
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Heuristics for scheduling unrelated parallel machines
- Minimizing the number of tardy jobs for m parallel machines
- Parallel machine scheduling with splitting jobs
- Scheduling independent tasks to reduce mean finishing time
- Scheduling with parallel processors and linear delay costs
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Technical Note—Minimizing Average Flow Time with Parallel Machines
This page was built for publication: An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696463)