Guided local search with shifting bottleneck for job shop scheduling
Article Abstract:
Several local search methods for job shop scheduling utilize interchange of operations, embedded in a simulated annealing or tabu search technique. The Guided Local Search (GLS), which is a new variable depth search technique relying on an interchange technique and employing the new concept of neighborhood trees, was formulated. The structural attributes of the neighborhood were employed as guideposts in directing the search into promising directions. This process was able to perform as well or even better than other processes. However, a hybrid process which embeds GLS into a Shifting Bottleneck strategy and benefits from the variances between the two neighborhood structures was seen to perform even more efficient.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1998
User Contributions:
Comment about this article or add new information about this topic:
Guided local search with shifting bottleneck for job shop scheduling
Article Abstract:
Several local search procedures for job shop scheduling employ interchange of operations, embedded in a simulated annealing or tabu search procedure. The Guided Local Search (GLS), which is a new variable depth search process relying on an interchange technique and employing the new concept of neighborhood trees, was developed. The structural attributes of the neighborhood were employed as guideposts in directing the search into promising directions. This process was able to perform as well or even better than other processes. However, a hybrid process which embeds GLS into a Shifting Bottleneck strategy and benefits from the variances between the two neighborhood structures was seen to perform even more efficient.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1998
User Contributions:
Comment about this article or add new information about this topic:
The shifting bottleneck procedure for job shop scheduling
Article Abstract:
An approximation technique is described for solving the minimum 'makespan' problem of scheduling job shops. The method sequences the machines successively, one by one, taking each instance the machine had seen as a bottleneck among the machines not as yet sequenced. Each time after a new machine is sequenced, all earlier-established sequences are locally optimized again. Both the local reoptimization procedures and the bottleneck identification are based on repeatedly solving some one-machine scheduling difficulties.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1988
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: The dollar cycles up again. Buckle up for a soft landing. The business cycle is alive and well
- Abstracts: Wounded kangaroo. Big plans for the future. Pacific storm
- Abstracts: Dig Those Cats. Day of Reckoning
- Abstracts: The human element: the real challenge in modernizing cost systems. OPUS: a new concept for mastering cost
- Abstracts: Retrospective accounts of research factors associated with significant and not-so-significant research outcomes