On a parallel machine scheduling problem with equal processing times

DOI10.1016/j.dam.2008.09.003zbMath1186.68068OpenAlexW2115053433WikidataQ57633889 ScholiaQ57633889MaRDI QIDQ1028485

Frank Werner, Svetlana A. Kravchenko

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.09.003

zbMATH Keywords

linear programmingparallel machine scheduling

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Scheduling with multiple servers ⋮ Scheduling jobs with equal processing times subject to machine eligibility constraints ⋮ Parallel machine problems with equal processing times: a survey ⋮ Minimizing total tardiness on parallel machines with preemptions ⋮ Fast LP models and algorithms for identical jobs on uniform parallel machines

Cites Work

• Scheduling jobs with equal processing times and time windows on identical parallel machines
• Scheduling equal-length jobs on identical parallel machines
• Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
• A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs