On a parallel machine scheduling problem with equal processing times

DOI10.1016/J.DAM.2008.09.003MaRDI QIDQ1028485zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Svetlana A. Kravchenko, Frank Werner

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)

Recommendations

• Scheduling equal-length jobs on identical parallel machines
• Parallel machine scheduling with time dependent processing times
• Equal processing time bicriteria scheduling on parallel machines
• Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
• Parallel scheduling problem with non-simultaneous machine available times

Cites work

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

Cited in

(11)

• Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
• Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
• Parallel machine problems with equal processing times: a survey
• Variants of Multi-resource Scheduling Problems with Equal Processing Times
• Fast LP models and algorithms for identical jobs on uniform parallel machines
• Scheduling jobs with equal processing times and a single server on parallel identical machines
• Scheduling equal-length jobs on identical parallel machines
• Minimizing total tardiness on parallel machines with preemptions
• Scheduling jobs with equal processing times subject to machine eligibility constraints
• A new polynomial algorithm for a parallel identical scheduling problem
• Scheduling with multiple servers

This page was built for publication: On a parallel machine scheduling problem with equal processing times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028485)