Applying a hybrid job shop procedure to a Belgian manufacturing company producing industrial wheels and castors in rubber

Authors:
Veronique Sels;Frederic Steen;Mario Vanhoucke
Affiliations:
Faculty of Economics and Business Administration, Ghent University, Tweekerkenstraat 2, 9000 Gent, Belgium;Faculty of Economics and Business Administration, Ghent University, Tweekerkenstraat 2, 9000 Gent, Belgium;Faculty of Economics and Business Administration, Ghent University, Tweekerkenstraat 2, 9000 Gent, Belgium and Operations and Technology Management Centre, Vlerick Leuven Gent Management School, R ...
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 26
Cited 0

The shifting bottleneck procedure for job shop scheduling

Management Science
An algorithm for solving the job-shop problem

Management Science
Job shop scheduling by simulated annealing

Operations Research
A branch and bound algorithm for the job-shop scheduling problem

Discrete Applied Mathematics - Special volume: viewpoints on optimization
A genetic algorithm for the job shop problem

Computers and Operations Research - Special issue on genetic algorithms
Evolution based learning in a job shop scheduling environment

Computers and Operations Research - Special issue on genetic algorithms
The one-machine problem with delayed precedence constraints and its use in job shop scheduling

Management Science
Design of efficient job shop scheduling rules

Proceedings of the 21st international conference on Computers and industrial engineering
A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem

Computers and Operations Research
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling

Management Science
A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies

Computers and Industrial Engineering - Special issue on computational intelligence for industrial engineering
Decomposition methods for large job shops

Computers and Operations Research
The hybrid heuristic genetic algorithm for job shop scheduling

Computers and Industrial Engineering
A Computational Study of Shifting Bottleneck Procedures forShop Scheduling Problems

Journal of Heuristics
An Advanced Tabu Search Algorithm for the Job Shop Problem

Journal of Scheduling
Algorithm based on taboo search and shifting bottleneck for job shop scheduling

Journal of Computer Science and Technology
A hybrid particle swarm optimization for job shop scheduling problem

Computers and Industrial Engineering
A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem

Computers and Operations Research
A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems

Computers and Industrial Engineering
Modeling realistic hybrid flexible flowshop scheduling problems

Computers and Operations Research
Job shop scheduling with setup times, deadlines and precedence constraints

Journal of Scheduling
Algorithms for a realistic variant of flowshop scheduling

Computers and Operations Research
A distributed shifting bottleneck heuristic for complex job shops

Computers and Industrial Engineering
A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem

Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

Computers and Operations Research
Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems

International Journal of Metaheuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, several methods for job shop scheduling are combined, adjusted and successfully applied to a real-world scheduling problem at a Belgian manufacturer producing industrial wheels and castors in rubber. The procedure is an extension of a hybrid shifting bottleneck procedure with a tabu search algorithm while incorporating various company specific constraints. The various extensions to cope with the company specific constraints have a strong similarity with the complex job shop problem formulation of Mason, Fowler, and Carlyle (2002). The new procedure is used as a simulation engine to test the relevance of various scenarios in order to improve the current planning approach of the company. A detailed computational experiment highlights the main contribution of the novel procedure for the company.