New Meta-Heuristic for Dynamic Scheduling in Permutation Flowshop with New Order Arrival

Weibo Liu, Yan Jin, Mark Price

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)
214 Downloads (Pure)

Abstract

Permutation flowshop scheduling problem (PFSP) has attracted lots of attention from both academia and industry as it finds many applications especially for today’s mass customisation. The PFSP is proved NP-hard, and the dynamic uncertainties such as stochastic new order arrivals significantly increase the problem complexity and difficulty. Many enterprises often struggle to make decisions on accepting new orders and setting due dates for them due to lack of effective scheduling methods. To fill in the knowledge gap, this paper is to propose a new meta-heuristic algorithm which is based on a new enhanced destruction & construction method and a novel repair method while adopting the architecture of the iterated greedy algorithm. Statistical tests were conducted and results show that the new algorithm outperforms existing ones.
Original languageEnglish
Pages (from-to)1-14
JournalInternational Journal of Advanced Manufacturing Technology
Early online date24 Jun 2018
DOIs
Publication statusEarly online date - 24 Jun 2018

Keywords

  • Dynamic scheduling
  • New order
  • Permutation flowshop
  • Iterated greedy algorithm
  • Order mixing

Fingerprint Dive into the research topics of 'New Meta-Heuristic for Dynamic Scheduling in Permutation Flowshop with New Order Arrival'. Together they form a unique fingerprint.

Cite this