Loading...

Flowshop-scheduling problems with makespan criterion: A review

Reza Hejazi, S ; Sharif University of Technology | 2005

171 Viewed
  1. Type of Document: Article
  2. DOI: 10.1080/0020754050056417
  3. Publisher: 2005
  4. Abstract:
  5. 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/cmax or equivalently F/prmu/cmax) for future research needs of improving and developing better approaches to flowshop-related scheduling problems. © 2005 Taylor & Francis Group Ltd
  6. Keywords:
  7. Dynamic programming ; Genetic algorithms ; Heuristic methods ; Optimization ; Simulated annealing ; Surveys ; Flowshop-scheduling problems ; Metaheuristics ; Tabu search ; Scheduling
  8. Source: International Journal of Production Research ; Volume 43, Issue 14 , 2005 , Pages 2895-2929 ; 00207543 (ISSN)
  9. URL: https://www.tandfonline.com/doi/abs/10.1080/0020754050056417