Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
From MaRDI portal
Publication:706379
DOI10.1007/s001860300336zbMath1083.90021OpenAlexW2083845110MaRDI QIDQ706379
Philippe Baptiste, Timkovsky, Vadim G.
Publication date: 8 February 2005
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001860300336
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items (10)
A survey on how the structure of precedence constraints may change the complexity class of scheduling problems ⋮ A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows ⋮ Polynomial-time approximation schemes for scheduling problems with time lags ⋮ Normal-form preemption sequences for an open problem in scheduling theory ⋮ A new polynomial algorithm for a parallel identical scheduling problem ⋮ A decomposition scheme for single stage scheduling problems ⋮ Ideal schedules in parallel machine settings ⋮ Fast LP models and algorithms for identical jobs on uniform parallel machines ⋮ An efficient algorithm for finding ideal schedules ⋮ How small are shifts required in optimal preemptive schedules?
This page was built for publication: Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
