2014
DOI: 10.1111/itor.12105
|View full text |Cite
|
Sign up to set email alerts
|

A simulated annealing with multiple‐search paths and parallel computation for a comprehensive flowshop scheduling problem

Abstract: Recent studies have demonstrated that the performance of a simulated annealing algorithm can be improved by following multiple-search paths and parallel computation. In this paper, we use these strategies to solve a comprehensive mathematical model for a flexible flowshop lot streaming problem. In the flexible flowshop environment, a number of jobs will be processed in several consecutive production stages, and each stage may involve a certain number of parallel machines that may not be identical. Each job has… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 44 publications
0
4
0
Order By: Relevance
“…Based on the lessons learnt from the real‐world applications, we are currently constructing an intelligent decision support system, which can automatically generate importance weights of rescue tasks, perform parallel computation and multiple‐path search (Defersha, ), and extract important features from the scheduling solutions, and thus provide a much more effective decision support to emergency response. We believe that further extensions and applications of our approach can substantially contribute to the development of disaster management.…”
Section: Discussionmentioning
confidence: 99%
“…Based on the lessons learnt from the real‐world applications, we are currently constructing an intelligent decision support system, which can automatically generate importance weights of rescue tasks, perform parallel computation and multiple‐path search (Defersha, ), and extract important features from the scheduling solutions, and thus provide a much more effective decision support to emergency response. We believe that further extensions and applications of our approach can substantially contribute to the development of disaster management.…”
Section: Discussionmentioning
confidence: 99%
“…Tabu search [Rudek, 2014, Jin et al, 2012, Bozejko et al, 2017, Bozejko et al, 2013, Czapinski and Barnes, 2011, James et al, 2009, Czapiński, 2013, Bukata et al, 2015, Cordeau and Maischberger, 2012, Wei et al, 2017, Janiak et al, 2008, Shylo et al, 2011, Jin et al, 2014, Bożejko et al, 2016, Jin et al, 2011, Maischberger and Cordeau, 2011, Van Luong et al, 2013, Dai et al, 2009] Simulated annealing [Thiruvady et al, 2016, Rudek, 2014, Defersha, 2015, Mu et al, 2016, Ferreiro et al, 2013, Lou and Reinitz, 2016, Banos et al, 2016, 2016, Lazarova and Borovska, 2008 Variable neigborhood search [Yazdani et al, 2010, Lei and Guo, 2015, Davidović and Crainic, 2012, Quan and Wu, 2017, Menendez et al, 2017, Eskandarpour et al, 2013, Coelho et al, 2016, Polat, 2017, Tu et al, 2017, Aydin and Sevkli, 2008, Polacek et al, 2008 (Greedy randomized)…”
Section: Algorithm Typementioning
confidence: 99%
“…Numerous papers have been published in the last few years on different variants of the permutation flowshop scheduling problem (Dhouib et al., ; Juan et al., ; , Bai, ; Defersha, ; Ren et al., 2015; Wang and Zhang, ; Wang et al., , to name just a few). A particular interest has been devoted to the two‐machine flowshop with various job settings, including release dates (Xie et al., ), time delays (Msakni et al., ), deteriorating jobs (Cheng et al., ), setup times (Detienne et al., ), and learning‐based processing times (Lai et al.…”
Section: Introductionmentioning
confidence: 99%