DMCA
Local Optimization and The Job-Shop Scheduling Problem (1994)
| Venue: | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH |
| Citations: | 8 - 0 self |
BibTeX
@ARTICLE{Lourenço94localoptimization,
author = {Helena Ramalhinho Lourenço},
title = {Local Optimization and The Job-Shop Scheduling Problem},
journal = {EUROPEAN JOURNAL OF OPERATIONAL RESEARCH},
year = {1994},
volume = {83},
pages = {347--364}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We do a computational study of different local optimization methods to solve the job-shop scheduling problem. In this problem we are given a set of jobs to be scheduled on a set of machines. The objective is to schedule the jobs on the machines so that we minimize the time by which all jobs are completed. This problem has been widely studied and various techniques have been used to solve them. We consider several approximation methods to solve the job-shop scheduling problem. We focus on local optimization methods, reviewing the application of the techniques known as local improvement and simulated annealing to this problem. We propose a variant of the above local optimization methods, known as large-step optimization, to solve the job-shop scheduling problem. We present computational results obtained from the application of all these methods to several instances of the problem. From the computational results we can conclude that the local improvement method is clearly inferior, even w...
Keyphrases
job-shop scheduling problem local optimization local optimization method various technique different local optimization method computational result computational study several instance local improvement present computational result large-step optimization several approximation method local improvement method
