- 1
-
J.O. Achugbue and F.Y. Chin.
Scheduling the open shop to minimize mean flow time.
SIAM J. Comput., 11:709-720, 1982.
- 2
-
P. Baptiste.
On minimizing the weighted number of late jobs in unit execution time
open-shops.
European J. Oper. Res., 149(2):344-354, 2003.
- 3
-
P. Brucker, T.C.E. Cheng, S. Knust, and N.V. Shakhlevich.
Complexity results for flow-shop and open-shop problems with
transportation delays.
Annals of Operations Research, 129:81-106, 2004.
- 4
-
P. Brucker, B. Jurisch, and M. Jurisch.
Open shop problems with unit time operations.
Z. Oper. Res., 37(1):59-73, 1993.
- 5
-
T. Gonzalez and S. Sahni.
Open shop scheduling to minimize finish time.
J. Assoc. Comput. Mach., 23(4):665-679, 1976.
- 6
-
S. Knust.
Shop-scheduling problems with transportation.
PhD thesis, Universität Osnabrück, Fachbereich
Mathematik/Informatik, 1999.
- 7
-
S.A. Kravchenko.
On the complexity of minimizing the number of late jobs in unit time
open shops.
Discrete Appl. Math., 100(2):127-132, 1999.
- 8
-
E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan.
Minimizing maximum lateness in a two-machine open shop.
Math. Oper. Res., 6(1):153-158, 1981.
- 9
-
E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan.
Erratum: ``Minimizing maximum lateness in a two-machine open
shop'' [Math. Oper. Res. 6 (1981), no. 1, 153-158].
Math. Oper. Res., 7(4):635, 1982.
- 10
-
J.K. Lenstra.
Not published.
- 11
-
C.Y. Liu and R.L. Bulfin.
Scheduling open shops with unit execution times to minimize functions
of due dates.
Oper. Res., 36(4):553-559, 1988.
- 12
-
V.J. Rayward-Smith and D. Rebaine.
Open shop scheduling with delays.
RAIRO Inform. Théor. Appl., 26(5):439-447, 1992.
- 13
-
T. Tautenhahn and G.J. Woeginger.
Minimizing the total completion time in a unit-time open shop with
release times.
Oper. Res. Lett., 20(5):207-212, 1997.
- 14
-
W. Yu.
The two-machine flow shop problem with delays and the
one-machine total tardiness problem.
PhD thesis, Technische Universiteit Eindhoven, Eindhoven, 1996.
Dissertation, Technische Universiteit Eindhoven, Eindhoven, 1996.
- 15
-
W. Yu, H. Hoogeveen, and J.K. Lenstra.
Minimizing makespan in a two-machine flow shop with delays and
unit-time operations is NP-hard.
J. Sched., 7(5):333-348, 2004.
WWW daemon apache
2009-06-29