Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
Year of publication: |
2004
|
---|---|
Authors: | Baptiste, Philippe ; Timkovsky, Vadim G. |
Published in: |
Mathematical Methods of Operations Research. - Springer. - Vol. 60.2004, 1, p. 145-153
|
Publisher: |
Springer |
Subject: | Scheduling | Parallel machine | Flowshop | Complexity |
-
Baptiste, Philippe, (2004)
-
TWO-STAGE FLOWSHOP SCHEDULING PROBLEMS WITH IDENTICAL AND BATCH PROCESSORS
WANG, WEN-WEI, (2010)
-
Braun, Oliver, (2002)
- More ...
-
Baptiste, Philippe, (2004)
-
On preemption redundancy in scheduling unit processing time jobs on two parallel machines
Baptiste, Philippe, (2001)
-
Baptiste, Philippe, (2004)
- More ...