Heuristic algorithms for the two-stage hybrid flowshop problem

Authors:
Mohamed Haouari;Rym M'Hallah
Affiliations:
Ecole Polytechnique de Tunisie-BP 51, 2070 La Marsa, Tunisia;Institut Régional de Sciences Informatique et Télécommunications, BP 212, 1082 Tunis, Tunisia
Venue:
Operations Research Letters
Year:
1997

Citing 3
Cited 15

BPSS: a scheduling support system for the packaging industry

Operations Research
Scheduling in Computer and Manufacturing Systems

Scheduling in Computer and Manufacturing Systems
Minimizing makespan in hybrid flowshops

Operations Research Letters

A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks

Journal of Scheduling
Production and delivery scheduling problem with time windows

Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines

Computers and Operations Research
A new heuristic for scheduling the two-stage flowshop with additional resources

Computers and Industrial Engineering
Optimal cash flow and operational planning in a company supply chain

International Journal of Computer Integrated Manufacturing - Industrial Engineering and Systems Management
Scheduling hybrid flowshop with parallel batching machines and compatibilities

Computers and Operations Research
A genetic algorithm and a simulated annealing algorithm combined with column generation technique for solving the problem of scheduling in the hybrid flowshop with additional resources

Computers and Industrial Engineering
Scheduling of a single crane in batch annealing process

Computers and Operations Research
Production and delivery scheduling problem with time windows

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
Heuristic algorithms for preemptive scheduling in a two-stage hybrid flowshop with additional renewable resources at each stage

Computers and Industrial Engineering
Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search

Computers and Industrial Engineering
Solving flexible flow-shop problem with a hybrid genetic algorithm and data mining: A fuzzy approach

Expert Systems with Applications: An International Journal
Ant colony optimization algorithm for a Bi-criteria 2-stage hybrid flowshop scheduling problem

Journal of Intelligent Manufacturing
An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A two-stage Hybrid Flowshop Problem (FS"m"""1"," "m"""2) is a two-center shop with several parallel machines per center and n jobs to be processed on at most one machine per center. The objective consists of minimizing the maximum completion time. Two two-phase methods based on Simulated Annealing and Tabu Search are proposed. The results are compared with solutions provided by existing heuristics, and with a new derived lower bound. These comparisons show the superiority of the derived lower bound and the efficiency of the proposed heuristic. The Tabu search based heuristic yields the optimal solution for 35% of the problems. Its average relative error is 0.82%.