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

DOI10.1080/02522667.2005.10699643zbMath1118.90038OpenAlexW1967037696MaRDI QIDQ5696463

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

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

Cites Work

• A state-of-the-art review of parallel-machine scheduling research
• Minimizing the number of tardy jobs for \(m\) parallel machines
• Parallel machine scheduling with splitting jobs
• Heuristics for scheduling unrelated parallel machines
• 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
• Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems

This page was built for publication: An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines