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 |
| |
Institution: | (1) Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Yuseong-gu, Daejeon, 305-701, Republic of Korea;(2) Institute of Production and Robotics, Ecole Polytechnique Federale de Lausanne, Batiment ME, Lausanne, 1015, Switzerland |
| |
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. |
| |
Keywords: | Scheduling Heuristics Hybrid flowshop Product-mix ratio Makespan |
本文献已被 SpringerLink 等数据库收录! |
|