Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint

Authors:
Yeong-Dae Kim;Byung-Jun Joo;Jong-Ho Shin
Affiliations:
Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea 305-701;Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea 305-701;Institute of Production and Robotics, Ecole Polytechnique Federale de Lausanne, Lausanne, Switzerland 1015
Venue:
Journal of Heuristics
Year:
2009

Citing 10
Cited 1

An adaptable scheduling algorithm for flexible flow lines

Operations Research
Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective

Computers and Operations Research
A backward approach in list scheduling algorithms for multi-machine tardiness problems

Computers and Operations Research
Two-stage flowshop scheduling with a common second-stage machine

Computers and Operations Research
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications

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

Computers and Industrial Engineering
Heuristic Algorithms and Scatter Search for the Cardinality Constrained P|Cmax Problem

Journal of Heuristics
A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time

Computers and Operations Research
Scheduling a hybrid flowshop with batch production at the last stage

Computers and Operations Research

A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper focuses on the scheduling problem of minimizing makespan for a given set of jobs in a two-stage hybrid flowshop subject to a product-mix ratio constraint. There are identical parallel machines at the first stage of the hybrid flowshop, while there is a single batch-processing machine at the second stage. Ready times of the jobs (at the first stage) may be different, and a given product-mix ratio of job types should be kept in each batch at the second stage. We present three types of heuristic algorithms: forward scheduling algorithms, backward scheduling algorithms, and iterative algorithms. To evaluate performance of the suggested algorithms, a series of computational experiments are performed on randomly generated test problems and results are reported.