Complexity results for flow-shop and open-shop scheduling problems with transportation delays
From MaRDI portal
Publication:596453
DOI10.1023/B:ANOR.0000030683.64615.c8zbMath1056.90057OpenAlexW1977097098MaRDI QIDQ596453
Natalia V. Shakhlevich, Sigrid Knust, Peter Brucker, Cheng, T. C. Edwin
Publication date: 10 August 2004
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:anor.0000030683.64615.c8
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (21)
Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints ⋮ Polynomial-time approximation schemes for scheduling problems with time lags ⋮ Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass ⋮ On a routing Open Shop Problem on two nodes with unit processing times ⋮ A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times ⋮ Complexity of problem \(TF2|v=1,c=2|C_{\max}\) ⋮ A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size ⋮ On the complexity of open shop scheduling with time lags ⋮ Preemptive scheduling on two identical parallel machines with a single transporter ⋮ Vyacheslav Tanaev: contributions to scheduling and related areas ⋮ Some results of the worst-case analysis for flow shop scheduling with a learning effect ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Irreducible bin packing and normality in routing open shop ⋮ Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited ⋮ Scheduling parallel batching machines in a sequence ⋮ Transporting jobs through a two‐machine open shop ⋮ A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing ⋮ Permutation flowshop scheduling problems with maximal and minimal time lags
This page was built for publication: Complexity results for flow-shop and open-shop scheduling problems with transportation delays
