A combined dispatching criteria approach to scheduling dual flow-shops

Chie Wun Chiou*, Wen Min Chen, Muh-Cherng Wu

*Corresponding author for this work

Research output: Contribution to journalArticle

5 Scopus citations

Abstract

This study investigates a dual flow-shops scheduling problem. In the scheduling context, there are two flow shops and each shop involves three processing stages. The two shops are functionally identical but their stage processing times for a job are different. While sequentially going through the three processing stages, each job is allowed to travel between the two shops. That is, for a job, each of its three stages could be processed in any of the two shops. Such a context is called dual flow-shops in the sense that the two flow shops' capacities are completely shared. The scheduling problem involves two decisions: (1) route assignment (i.e. assigning the processing stages of a job to a shop), and (2) job sequencing (i.e. sequencing the jobs waiting before each stage). The scheduling objective is to minimise the coefficient of variation of slack time (CVS), in which the slack time (also called lateness) denotes the difference between the due date and total completion time of a job. We propose five genetic-algorithm-based (GA-based) solution methods to solve the scheduling problem, which are called GA-EDD, GA-FIFO, GA-SPT, GA-LFO, and GA-COMBO respectively. Numerical experiments indicate that GA-COMBO outperforms the other four methods.

Original languageEnglish
Pages (from-to)927-939
Number of pages13
JournalInternational Journal of Production Research
Volume51
Issue number3
DOIs
StatePublished - 1 Feb 2013

Keywords

  • combined dispatching criteria
  • cross-shop production
  • dual flow-shops
  • genetic algorithm (GA)
  • scheduling

Fingerprint Dive into the research topics of 'A combined dispatching criteria approach to scheduling dual flow-shops'. Together they form a unique fingerprint.

  • Cite this