An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines

DOI10.1080/02522667.2005.10699643MaRDI QIDQ5696463zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

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

Cited in

(1)

• Strong LP Formulations for Scheduling Splittable Jobs on Unrelated 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)