Solving job shop scheduling problems utilizing the properties of backbone and "big valley"

Authors:
Panos M. Pardalos;Oleg V. Shylo;Alkis Vazacopoulos
Affiliations:
Dept. of Industrial and Systems Engineering, University of Florida, Gainesville, USA 32611;Dept. of Industrial and Systems Engineering, University of Florida, Gainesville, USA 32611;Dash Optimization Inc., Englewood Cliffs, USA 07632
Venue:
Computational Optimization and Applications
Year:
2010

Citing 7
Cited 2

Job shop scheduling by simulated annealing

Operations Research
A fast taboo search algorithm for the job shop problem

Management Science
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling

Management Science
Problem difficulty for tabu search in job-shop scheduling

Artificial Intelligence
Parallel GRASP with path-relinking for job shop scheduling

Parallel Computing - Special issue: Parallel computing in numerical optimization
An Advanced Tabu Search Algorithm for the Job Shop Problem

Journal of Scheduling
How the landscape of random job shop scheduling instances depends on the ratio of jobs to machines

Journal of Artificial Intelligence Research

A GA/TS algorithm for the stage shop scheduling problem

Computers and Industrial Engineering
A GES/TS algorithm for the job shop scheduling

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new metaheuristic for the job shop scheduling problem is proposed. Our approach uses the backbone and "big valley" properties of the job shop scheduling problem. The results of the computational experiments have demonstrated the high efficiency of our approach. New upper bounds have been obtained for many problems.