摘要
This paper is a complete survey of flowshop-scheduling problems and contributions from early works of Johnson of 1954 to recent approaches of metaheuristics of 2004. It mainly considers a flowshop problem with a makespan criterion and it surveys some exact methods (for small size problems), constructive heuristics and developed improving metaheuristic and evolutionary approaches as well as some well-known properties and rules for this problem. Each part has a brief literature review of the contributions and a glimpse of that approach before discussing the implementation for a flowshop problem. Moreover, in the first section, a complete literature review of flowshop-related scheduling problems with different assumptions as well as contributions in solving these other aspects is considered. This paper can be seen as a reference to past contributions (particularly in n/m/p/c(max) or equivalently F/prmu/c(max)) for future research needs of improving and developing better approaches to flowshop-related scheduling problems.
学科与关键词
- A review and evaluation of multiobjective algorithms for the flowshop scheduling problemMinella, Gerardo*; Ruiz, Ruben; Ciavotta, MicheleINFORMS JOURNAL ON COMPUTING, 2008, 20(3): 451-471.被引 132
- Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trendsYenisey, Mehmet Mutlu; Yagmahan, Betul*OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2014, 45: 119-135.被引 171
- A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluationFernandez-Viagas, Victor; Ruiz, Ruben*; Framinan, Jose M.EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 257(3): 707-721.被引 160
