A parallel implementation of a job shop scheduling heuristic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1947, Issue , 2001, Pages 215-222

  Der, U ^a   Steinhofel K ^a,b  

^a German National Research Center for Information Technology   (Germany)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; OPTIMIZATION; SCHEDULING; SIMULATED ANNEALING;

BENCH-MARK PROBLEMS; COMPLETION TIME; COMPUTATIONAL EXPERIMENT; DISJUNCTIVE GRAPHS; DISTRIBUTED COMPUTING ENVIRONMENT; JOB SHOP SCHEDULING PROBLEMS; OPTIMUM SOLUTION; PARALLEL IMPLEMENTATIONS;

JOB SHOP SCHEDULING;

EID: 84941054412     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-70734-4     Document Type: Conference Paper

References (16)

1. E.H.L. Aarts. Local Search in Combinatorial Optimization. Wiley, NY, 1998.
2. E.H.L. Aarts and J.H.M. Korst. Simulated Annealing and Boltzmann Machines: A Stochastic Approach. Wiley, NY, 1989.
3. M. Besch, H. Bi, P. Enskonatus, G. Heber, M. Wilhelmi. High-level Data Parallel Programming in PROMOTER. Proc. Intern. Workshop on High-level Parallel Programming Models and Supportive Environments, pp. 47-54, 1997.
4. H. Bi, M. Kessler, H. W. Pohl, M. Tief. Promise-High-level Data-parallel Programming Environment. Proc. Workshop on Advanced Parallel Processing Technologies, pp. 207-211, Publishing House of Electronic Industry, 1999.
5. E. Dekel and S. Shani. A Parallel Matching Algorithm for Convex Bibartite Graphs and Applications to Scheduling. Journal of Parallel and Distributed Computing, 1:185-205, 1984.
6. M.R. Garey and D.S. Johnson. Complexity Results for Multiprocessor Scheduling under Resource Constraints. SIAM Journal on Computing, 4(4):397-411, 1975.
7. Lawrence, S., Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement), Technical Report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania, 1984.
8. J.F. Muth, G.L. Thompson, and P.R. Winters, editors. Industrial Scheduling. Prentice-Hall, Englewood Cliffs, N.J., 1963.
9. M. Perregaard and J. Clausen. Parallel Branch-and-Bound Methods for the Job-Shop Scheduling Problem. Annals of Operations Research, 83:137-160, 1998.
10. K. Steinhöfel, A. Albrecht, and C.K. Wong. Two Simulated Annealing-Based Heuristics for the Job Shop Scheduling Problem. European Journal of Operational Research, 118(3):524-548, 1999.
11. K. Steinhöfel, A. Albrecht, and C.K. Wong. On Parallel Heuristics for the Job Shop Scheduling Problem. In: S.Q. Zheng, editor, Proc. 11th International Conf. on Parallel and Distributed Computing and Systems, pp. 806-811, MIT, Cambridge, Mass., November 3-6, 1999.
12. E. Taillard. Parallel Taboo Search Techniques for the Job-Shop Scheduling Problem. ORSA Journal on Computing, 6:108-117, 1994.
13. P.J.M. Van Laarhoven, E.H.L. Aarts, and J.K. Lenstra. Job Shop Scheduling by Simulated Annealing. Operations Research, 40(1):113-125, 1992.
14. M.G.A. Verhoeven, H.M.M. ten Eikelder, B.J.M. Aarts, E.H.L. Aarts. Sequential and Parallel Local Search Algorithms for Job Shop Scheduling. Meta-Heuristics (Advances and Trends in Local Search Paradigms for Optimization), pp. 359-371, 1999.
15. D.P. Williamson, L.A. Hall, J.A. Hoogeveen, C.A.J. Hurkens, J.K. Lenstra, S.V. Sevast'janov, and D.B. Shmoys. Short Shop Schedules. Operations Research, 45:288-294, 1997.
16. Yamada, T. and Nakano, R., A Genetic Algorithm Applicable to Large-Scale Job Shop Problems, In: R. Manner and B. Manderick (eds.), Proc. 2nd International Conf. on Parallel Problem Solving from Nature, North-Holland, Amsterdam, 1992, pp. 281-290.