1 |
Ahuja, R.A., K. Mehlhorn, and J.B. Orlin, "Faster algorithm for the shortest path problem," Journal of the Association for Computing Machinery, Vol.37(1990), pp.213-223.
DOI
|
2 |
Allahverdi, A., J.N.D. Gupta, and T. Aldowaisan, "A review of scheduling research involving setup considerations," Omega, Vol.27(1999), pp.219-239.
DOI
ScienceOn
|
3 |
Baker, K.R. and D. Trietsch, Principles of Scheduling and Sequencing, John Wiley and Sons, Inc, 2009.
|
4 |
Cheng, T.C.E. and Z.L. Chen, "Parallel machine scheduling with batch setup times," Operations Research, Vol.42(1994), pp.1171-1174.
DOI
|
5 |
Liu, Z., W. Yu, and T.C.E. Cheng, "Scheduling groups of unit length jobs on two identical parallel machines," Information Processing Letters, Vol.69(1999), pp.275-281.
DOI
|
6 |
Webster, S.T., "The complexity of scheduling job families about a common due date," Operations Research Letters, Vol.20(1997), pp. 65-74.
DOI
|
7 |
Webster, S.T. and M. Azzioglu, "Dynamic programming algorithms for scheduling parallel machines with family setup times," Computers and Operations Research, Vol.28(2001), pp.127-137.
DOI
ScienceOn
|
8 |
Allahverdi, A., C.T. Ng, T.C.E. Cheng, and M.Y. Kovalyov, "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Vol.187(2008), pp.985-1032.
DOI
ScienceOn
|