Publisher
Springer International Publishing
Reference19 articles.
1. A. Ageev, Inapproximability lower bounds for open shop problems with exact delays, in eds. by A. Eremeev et al., OPTA 2018, CCIS 871 (Springer International Publishing AG, 2018), pp. 45–55
2. A. Ageev, A.V. Kononov, Approximation algorithms for scheduling problems with exact delays, in eds. by T. Erlebach, C. Kaklamanis, WAOA 2006, volume LNCS vol. 4368 (Springer, 2007), pp. 1–14
3. P. Brucker, S. Knust, T.C.E. Cheng, N.V. Shakhlevich, Complexity results for flow-shop and open-shop scheduling problems with transportation delays. Ann. Oper. Res. 129, 81–106 (2004)
4. E.G. Coffman Jr., D. Dereniowski, W. Kubiak, An efficient algorithm for finding ideal schedules. Acta Informatica 49, 1–14 (2012)
5. M. Dell’Amico, R. Vaessens, Flow and open shop scheduling on two machines with transportation times and machine-independent processing times is NP-hard. Materiali di discussione 141, Dipartimento di Economia Politica, Università di Modena, 1995