Local adjustments: A general algorithm

Processing a set of operations on a single processor that can handle at most one job at a time is an underlying issue of many combinatorial optimization problems, and especially classical scheduling problems, such as job-shops, flow-shops and other X-shops. The main goal of local operations is to na...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2005-07, Vol.164 (1), p.24-38
Main Authors: Péridy, Laurent, Rivreau, David
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Disjunctive scheduling
Edge-finding
Elimination rule
Exact sciences and technology
Job shop
Job shops
Operational research and scientific management
Operational research. Management science
Optimization
Scheduling
Scheduling, sequencing
Studies
Time-bound adjustments
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Processing a set of operations on a single processor that can handle at most one job at a time is an underlying issue of many combinatorial optimization problems, and especially classical scheduling problems, such as job-shops, flow-shops and other X-shops. The main goal of local operations is to narrow the time-windows of operations for that kind of disjunctive scheduling problem. In this paper, we investigate the properties of local adjustments and provide a unified and efficient framework for the combination of the main adjustment procedures. Beyond its rapid prototyping feature, our implementation is proved to guarantee a good stability property that finally leads to a better convergence process. Computational experiments on single machine and on job-shop scheduling problems are reported.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2003.11.020