Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

Open shop scheduling with delays

V. J. Rayward-Smith, D. Rebaine

RAIRO-Theor. Inf. Appl., 26 5 (1992) 439-447

Published online: 2017-02-01

DOI: https://doi.org/10.1051/ita/1992260504391

This article has been cited by the following article(s):

Shunzhang Lu, An Zhang, Mengyuan Hu, Yong Chen and Guangting Chen
15434 176 (2025)
https://doi.org/10.1007/978-981-96-4445-2_15

Reentrant open shop scheduling problem with time lags and no-wait constraints

Kenza Alioui, Karim Amrouche and Mourad Boudhar
Computers & Operations Research 166 106595 (2024)
https://doi.org/10.1016/j.cor.2024.106595

A Book of Open Shop Scheduling

Wieslaw Kubiak
International Series in Operations Research & Management Science, A Book of Open Shop Scheduling 325 261 (2022)
https://doi.org/10.1007/978-3-030-91025-9_12

Four decades of research on the open-shop scheduling problem to minimize the makespan

Mohammad Mahdi Ahmadian, Mostafa Khatami, Amir Salehipour and T.C.E. Cheng
European Journal of Operational Research 295 (2) 399 (2021)
https://doi.org/10.1016/j.ejor.2021.03.026

Liang Liu, Long Gong, Sen Yang, Jun Xu and Lance Fortnow
426 (2018)
https://doi.org/10.1109/CLOUD.2018.00060

Scheduling trucks on factory premises

Martin Wirth and Simon Emde
Computers & Industrial Engineering 126 175 (2018)
https://doi.org/10.1016/j.cie.2018.09.023

Flowshop problem F2 →D|v= 1,c≥ 1|Cmax revisited

Yan Lan, Xin Han, Yinling Wang, et al.
Theoretical Computer Science 670 79 (2017)
https://doi.org/10.1016/j.tcs.2017.01.018

Complexity of problem TF2|v=1,c=2|Cmax

Yan Lan, Xin Han, Zongtao Wu, He Guo and Xin Chen
Information Processing Letters 116 (1) 65 (2016)
https://doi.org/10.1016/j.ipl.2015.09.003

From Enumerating to Generating: A Linear Time Algorithm for Generating 2D Lattice Paths with a Given Number of Turns

Ting Kuo
Algorithms 8 (2) 190 (2015)
https://doi.org/10.3390/a8020190

The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan

Alix Munier-Kordon and Djamal Rebaine
European Journal of Operational Research 203 (1) 42 (2010)
https://doi.org/10.1016/j.ejor.2009.07.030

Transporting jobs through a two‐machine open shop

Irina N. Lushchakova, Alan J. Soper and Vitaly A. Strusevich
Naval Research Logistics (NRL) 56 (1) 1 (2009)
https://doi.org/10.1002/nav.20323

D. Rebaine
138 (2009)
https://doi.org/10.1109/ICCIE.2009.5223829

Two-machine shop scheduling with an uncapacitated interstage transporter

Chung-Yee Lee and Vitaly A. Strusevich
IIE Transactions 37 (8) 725 (2005)
https://doi.org/10.1080/07408170590918290

Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays

Peter Brucker, Sigrid Knust, T.C. Edwin Cheng and Natalia V. Shakhlevich
Annals of Operations Research 129 (1-4) 81 (2004)
https://doi.org/10.1023/B:ANOR.0000030683.64615.c8

A heuristic for the two-machine open-shop scheduling problem with transportation times

V.A. Strusevich
Discrete Applied Mathematics 93 (2-3) 287 (1999)
https://doi.org/10.1016/S0166-218X(99)00115-8

On the hardness of approximating optimum schedule problems in store and forward networks

A.E.F. Clementi and M. Di Ianni
IEEE/ACM Transactions on Networking 4 (2) 272 (1996)
https://doi.org/10.1109/90.491013

A. Clementi and M. Di Ianni
1336 (1994)
https://doi.org/10.1109/INFCOM.1994.337560