An approximate algorithm for a high-multiplicity parallel machine scheduling problem

DOI10.1016/j.orl.2010.03.009zbMath1193.90098OpenAlexW2009923570MaRDI QIDQ991471

Carlo Filippi

Publication date: 7 September 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2010.03.009

zbMATH Keywords

schedulingparallel machinesapproximationhigh multiplicity

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Exact and approximate algorithms for high-multiplicity parallel machine scheduling
• Probabilistic analysis of the minimum weighted flowtime scheduling problem
• Parallel machine scheduling with splitting jobs
• A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths
• Parallel Machine Scheduling, Linear Programming, and Parameter List Scheduling Heuristics
• Convex quadratic and semidefinite programming relaxations in scheduling
• On Scheduling Independent Tasks with Restricted Execution Times
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Multiplicity and complexity issues in contemporary production scheduling
• Scheduling Jobs on Several Machines with the Job Splitting Property
• Parallel machine scheduling with high multiplicity

This page was built for publication: An approximate algorithm for a high-multiplicity parallel machine scheduling problem