Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers

Authors:
Victor Yaurima;Larisa Burtseva;Andrei Tchernykh
Affiliations:
CESUES Superior Studies Center, Carretera a Sonoyta Km. 6.5, San Luis Rio Colorado, Sonora 83450, Mexico;Autonomous University of Baja California, Calle de la Normal, Col. Insurgentes Este, Mexicali, B.C 21270, Mexico;CICESE Research Center, Carretera Tijuana - Ensenada Km. 107, Ensenada, B.C 22860, Mexico
Venue:
Computers and Industrial Engineering
Year:
2009

Citing 18
Cited 3

BPSS: a scheduling support system for the packaging industry

Operations Research
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
A genetic algorithm for flowshop sequencing

Computers and Operations Research - Special issue on genetic algorithms
Genetic algorithms for flowshop scheduling problems

Computers and Industrial Engineering
Scheduling flowshops with finite buffers and sequence-dependent setup times

Computers and Industrial Engineering
Flowshop scheduling with limited temporary storage

Journal of the ACM (JACM)
Hybrid flow shop scheduling: a survey

Computers and Industrial Engineering
Simulation in production scheduling: scheduling flow-shops with limited buffer spaces

Proceedings of the 32nd conference on Winter simulation
On Permutation Representations for Scheduling Problems

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
New heuristics for no-wait flowshops to minimize makespan

Computers and Operations Research
An effective hybrid genetic algorithm for flow shop scheduling with limited buffers

Computers and Operations Research
Simple heuristics for scheduling with limited intermediate storage

Computers and Operations Research
Modeling realistic hybrid flexible flowshop scheduling problems

Computers and Operations Research
Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints

Computers and Industrial Engineering
Hybrid flowshop with unrelated machines, sequence dependent setup time and availability constraints: an enhanced crossover operator for a genetic algorithm

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Heuristic combined artificial neural networks to schedule hybrid flow shop with sequence dependent setup times

ISNN'05 Proceedings of the Second international conference on Advances in Neural Networks - Volume Part I
An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers

Mathematical and Computer Modelling: An International Journal
Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers

Mathematical and Computer Modelling: An International Journal

A novel artificial immune system for solving multiobjective scheduling problems subject to special process constraint

Computers and Industrial Engineering
An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan

Expert Systems with Applications: An International Journal
A dual encoding-based meta-heuristic algorithm for solving a constrained hybrid flow shop scheduling problem

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a genetic algorithm for an important production scheduling problem. Since the problem is NP-hard, we focus on suboptimal scheduling solutions for the hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints, and limited buffers. The production environment of a television assembly line for inserting electronic components is considered. The proposed genetic algorithm is a modified and extended version of the algorithm for a problem without limited buffers. It takes into account additional limited buffer constraints and uses a new crossover operator and stopping criteria. Experimental results carried out on real production settings show an improvement in scheduling when the proposed algorithm is used.