Two-machine open shop scheduling with special transportation times
From MaRDI portal
Publication:3157382
DOI10.1057/palgrave.jors.2600769zbMath1054.90551OpenAlexW2001801276MaRDI QIDQ3157382
Vitaly A. Strusevich, Djamal Rebaine
Publication date: 13 January 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600769
Related Items (13)
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ 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}\) ⋮ Two-machine interval shop scheduling with time lags ⋮ On the complexity of open shop scheduling with time lags ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ A memetic algorithm for the job-shop with time-lags ⋮ The routing open-shop problem on a network: complexity and approximation ⋮ A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network ⋮ 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
This page was built for publication: Two-machine open shop scheduling with special transportation times
