Open shop scheduling with delays

DOI10.1051/ita/1992260504391zbMath0766.90043OpenAlexW1532829258MaRDI QIDQ4020512

V. J. Rayward-Smith, Djamal Rebaine

Publication date: 17 January 1993

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92427

zbMATH Keywords

open shoppolynomial algorithmNP-completeinterprocessor delay

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

On-line two-machine open shop scheduling with time lags ⋮ Polynomial-time approximation schemes for scheduling problems with time lags ⋮ Complexity of problem \(TF2|v=1,c=2|C_{\max}\) ⋮ From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited ⋮ Transporting jobs through a two‐machine open shop ⋮ The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan ⋮ A heuristic for the two-machine open-shop scheduling problem with transportation times

Cites Work

• Unnamed Item
• UET scheduling with unit interprocessor communication delays
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• Open Shop Scheduling to Minimize Finish Time

This page was built for publication: Open shop scheduling with delays