An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines
DOI10.1080/02522667.2005.10699643zbMATH Open1118.90038OpenAlexW1967037696MaRDI QIDQ5696463FDOQ5696463
Authors: Chih-Ping Chiang 
Publication date: 18 October 2005
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.2005.10699643
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- A state-of-the-art review of parallel-machine scheduling research
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- Scheduling independent tasks to reduce mean finishing time
- Parallel machine scheduling with splitting jobs
- Scheduling with parallel processors and linear delay costs
- 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
Cited In (1)
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)
