Fatemi Ghomi S M T, Teimouri E. Path critical index and activity critical index in PERT networks [J]. European Journal of Operational Research, 2002, 141(1): 147-152.
[4]
Sede？o-Noda A, Alcaide López de Pablo D, González-Martín C. A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows [J]. European Journal of Operational Research, 2009, 196(1): 140-154.
Elmaghraby S E. Activity nets: a guided tour through some recent developments [J]. European Journal of Operational Research, 1995, 82(3): 383-408.
[9]
Chen Y L, Rinks D, Tang K. Critical path in an activity network with time-switch constraints[J]. European Journal of Operational Research, 1997, 100: 122-133.
[10]
Alcaide D, Chu C B, Kats V, Levener K, Sierksma G. Cyclic multiple-robot scheduling with time-window constraints using a critical path approach [J]. European Journal of Operational Research, 2007, 177(1):147-162.
[11]
Kats V, Lei L, Levner E. Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints [J]. European Journal of Operational Research, 2008, 187(3): 1196-1211.
[12]
Yang H H, Chen Y L. Finding the critical path in an activity network with time-switch constraints [J]. European Journal of Operational Research, 2000, 120(3): 603-613.
[13]
Guerriero F, Talarico L. A solution approach to find the critical path in a time-constrained activity network [J]. Computer & Operations Research, 2010, 37(9):1557-1569.
[14]
Vanhoucke M. New computational results for the discrete time/cost trade-off problem with time-switch constraints [J]. European Journal of Operational Research, 2005, 165(2): 359-374.
