Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint
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 ; Batch-Processing Machine ; Minimizing Total Tardiness ; Parallel Machines ; Completion-Time ; Genetic Algorithm ; Backward Approach ; Bound Algorithm ; Makespan ; Stage ; Shop
Record created on 2010-11-30, modified on 2016-08-09