1 |
Brinkkotter, W. and Brucker, P. (2001), Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments, Journal of Scheduling, 4, 53-64
DOI
ScienceOn
|
2 |
Giffler, B. and Thompson, G. L. (1960), Algorithms for solving production-scheduling problems, Operations Research, 8, 487-503
DOI
ScienceOn
|
3 |
Carlier, J. and Pinson, E. (1989), An algorithm for solving the job-shop problem, Management Science, 35, 164-176
DOI
ScienceOn
|
4 |
Kawata, Y., Morikawa, K., Takahashi, K., and Nakamura, N. (2003), Robustness optimization of the minimum makespan schedules in a job shop, International Journal of Manufacturing Technology and Management, 5, 1-9
DOI
ScienceOn
|
5 |
Perregaard, M. and Clausen, J. (1998), Parallel branchand- bound methods for the job-shop scheduling problem, Annals of Operations Research, 83, 137-160
DOI
|
6 |
Brucker, P., Jurisch, B., and Sievers, B. (1994), A branch and bound algorithm for the job-shop scheduling problem, Discrete Applied Mathematics, 49, 107-127
DOI
ScienceOn
|
7 |
Morikawa, K., Takahashi, K., and Tabata, K. (2005), Branch and bound based makespan minimization in job shops guided by search history, Proceedings of the 18th International Conference on Production Research, Salerno, Italy, (in CD-ROM)
|
8 |
Pezzella, F. and Merelli, E. (2000), A tabu search method guided by shifting bottleneck for the job shop scheduling problem, European Journal of Operational Research, 120, 297-310
DOI
ScienceOn
|
9 |
Carlier, J. (1982), The one-machine sequencing problem, European Journal of Operational Research, 11, 42-47
DOI
ScienceOn
|
10 |
Gueret, C., Jussien, N., and Prins, C. (2000), Using intelligent backtracking to improve branch-and-bound methods: An application to open-shop problems, European Journal of Operational Research, 127, 344-354
DOI
ScienceOn
|