Flow-shop scheduling for three serial stations with the last two duplicate

Authors:
Ahmet Bolat;Ibrahim Al-Harkan;Bandar Al-Harbi
Affiliations:
Industrial Engineering Department, College of Engineering, King Saud University, P.O. Box 800, Riyadh 11421, Saudi Arabia;Industrial Engineering Department, College of Engineering, King Saud University, P.O. Box 800, Riyadh 11421, Saudi Arabia;Industrial Engineering Department, College of Engineering, King Saud University, P.O. Box 800, Riyadh 11421, Saudi Arabia
Venue:
Computers and Operations Research
Year:
2005

Citing 9
Cited 4

Algorithms for real-time scheduling of jobs on mixed model assembly lines

Computers and Operations Research
A genetic algorithm for flowshop sequencing

Computers and Operations Research - Special issue on genetic algorithms
Determining the optimal number of duplicated process tanks in a single-hoist circuit board production line

Computers and Industrial Engineering
On merging sequencing and scheduling theory with genetic algorithms to solve stochastic job shops

On merging sequencing and scheduling theory with genetic algorithms to solve stochastic job shops
Total flowtime in no-wait flowshops with separated setup times

Computers and Operations Research
Flowshop scheduling with limited temporary storage

Journal of the ACM (JACM)
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence

Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms

Genetic Algorithms

Order acceptance using genetic algorithms

Computers and Operations Research
Semi-dynamic Demand in a Non-permutation Flowshop with Constrained Resequencing Buffers

Large-Scale Scientific Computing
A decision support system for production scheduling in an ion plating cell

Expert Systems with Applications: An International Journal
Performance study of a genetic algorithm for sequencing in mixed model non-permutation flowshops using constrained buffers

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses the problem of scheduling jobs for three serial stations with the last two duplicate, i.e., identical. The performance measure considered is the makespan, and a Branch and Bound and two heuristic procedures are proposed. Two dominance criteria are developed to produce the optimal schedule for the jobs sequenced so far. Extensive computational experiments reveal that the Genetic Algorithm can be used to obtain a group of effective solutions for any realistic size problem within small computation time.