A new heuristic algorithm for solving the job shop scheduling problem

AIP Conference Proceedings

Volumn 963, Issue 2, 2007, Pages 1412-1416

  Yin, Aihua ^a   Zhang, Shousheng ^a  

^a JIANGXI UNIVERSITY OF FINANCE AND ECONOMICS   (China)

Author keywords

Heuristic; Job shop scheduling; Quasi human; Quasi physics

Indexed keywords

EID: 71449087560     PISSN: 0094243X     EISSN: 15517616     Source Type: Conference Proceeding    
DOI: 10.1063/1.2836019     Document Type: Conference Paper

References (6)

1. S. French, Sequencing and Scheduling: An Introduction to the Mathematics of Job Shop, Horwood, Chichester, UK, 1982.
2. D. Applegate and W. Cook, A Computational Study of Job Shop Scheduling Problem, ORSA Journal on Computing, Vol 3, No. 2, pp. 149-156, 1991.
3. E. H. L. Aarts, P. J. M. Van Laarhoven, J. K.Lenstra and N. L. J. Ulder, A Computational Study of Local Search Algorithms for Job Shop Scheduling, ORSA Journal on Computing, Vol6, No. 2, pp. 118-125, 1994.
4. A.H.Yin, A Heuristic Algorithm for the Job Shop Scheduling Problem, In: H.Jin ed. Proceedings of the IFIP International Conference of Network and Parallel Computing, Wuhan 2004, Press by Springer Verlog in the LNCS Series: 118-128.
5. F. Pezzella, E. Merelli, A Tabu Search Method Guided by Shifting Bottleneck for the Job Shop Scheduling Problem. European Journal of Operational Research, Vol.120, No.2, 2000, pp. 297-310.
6. S. Lawrence, Supplement to "Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques" GSIA, Carnegie- Melon University, October 1984.