Minimizing the makespan in nonpreemptive parallel machine scheduling problem

DOI10.1007/s10852-009-9120-6zbMath1229.68083OpenAlexW1981927125MaRDI QIDQ655176

Maria Italia Gualtieri, Paolamaria Pietramala, Giampiero Chiaselotti

Publication date: 2 January 2012

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-009-9120-6

zbMATH Keywords

optimizationschedulingapproximation algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (1)

Partial solutions and multifit algorithm for multiprocessor scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A state-of-the-art review of parallel-machine scheduling research
• On the exact upper bound for the Multifit processor scheduling algorithm
• A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
• A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
• Tighter Bounds for the Multifit Processor Scheduling Algorithm
• A New Approximation Algorithm for the Nonpreemptive Scheduling of Independent Jobs on Identical Parallel Processors
• An Application of Bin-Packing to Multiprocessor Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Minimizing the makespan in nonpreemptive parallel machine scheduling problem