A hybrid particle swarm optimization approach for the job-shop scheduling problem
Authors:
- 23 November 2005
- journal article
- research article
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 29 (3-4) , 360-366
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Parallel GRASP with path-relinking for job shop schedulingParallel Computing, 2003
- A tabu search method guided by shifting bottleneck for the job shop scheduling problemEuropean Journal of Operational Research, 2000
- Some new results on simulated annealing applied to the job shop scheduling problemEuropean Journal of Operational Research, 1999
- Guided Local Search with Shifting Bottleneck for Job Shop SchedulingManagement Science, 1998
- The job shop scheduling problem: Conventional and new solution techniquesEuropean Journal of Operational Research, 1996
- A branch and bound algorithm for the job-shop scheduling problemDiscrete Applied Mathematics, 1994
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 1991
- Optimization by Simulated AnnealingScience, 1983
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976