On a parallel machine scheduling problem with equal processing times
From MaRDI portal
Publication:1028485
DOI10.1016/j.dam.2008.09.003zbMath1186.68068WikidataQ57633889 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
68W40: Analysis of algorithms
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Scheduling with multiple servers, Scheduling jobs with equal processing times subject to machine eligibility constraints, Fast LP models and algorithms for identical jobs on uniform parallel machines, Parallel machine problems with equal processing times: a survey, Minimizing total tardiness on parallel machines with preemptions
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