Multiprocessor open shop problem: literature review and future directions

被引:0
作者
Zeynep Adak
Mahmure Övül Arıoğlu Akan
Serol Bulkan
机构
[1] Gebze Technical University,Department of Industrial Engineering
[2] Marmara University,Department of Industrial Engineering
来源
Journal of Combinatorial Optimization | 2020年 / 40卷
关键词
Multiprocessor open shop; Review; Scheduling; Flexible open shop; Open shop with parallel machines;
D O I
暂无
中图分类号
学科分类号
摘要
Multi-processor open shop (MPOS) is a combination of the classical open shop and parallel shop environments. Although there exist wide application areas of this shop environment in both production and service facilities, the research in the field is still limited. In this paper, we provided a detailed review of the research on MPOS problem. With this survey, we aimed to provide a helpful guide to those who are willing to contribute to this open field of study. We have reviewed the studies in MPOS literature under the following topics: mathematical formulations, polynomial-time optimum solution algorithms for few special cases, approximation algorithms, dispatching rules, heuristics and metaheuristics. We further presented test data used in the literature and investigated the ways researchers evaluated their results. Solution representation and parameter tuning in metaheuristic applications have been also covered in detail. There is considerable room for improvement, especially in terms of near-optimal solution approaches. We closely investigated research topics that need particular attention in future research. We believe the review here will be a good starting point to study MPOS problem, even for those who have no prior knowledge of the field.
引用
收藏
页码:547 / 569
页数:22
相关论文
共 117 条
  • [1] Abdelmaguid TF(2020)Scatter search with path relinking for multiprocessor open shop scheduling Comput Ind Eng 141 106292-203
  • [2] Abdelmaguid TF(2014)A tabu search approach for proportionate multiprocessor open shop scheduling Comput Optim Appl 58 187-52
  • [3] Shalaby MA(2015)Literature review of open shop scheduling problems Intell Inf Manag 7 33-70
  • [4] Awwad MA(2014)Scheduling prioritized patients in emergency department laboratories Comput Methods Programs Biomed 117 61-215
  • [5] Anand E(2016)Flexible open shop scheduling problem to minimize makespan Comput Oper Res 67 207-191
  • [6] Panneerselvam R(1982)Nearly optimum solution of multimachine scheduling problems Szigma 15 177-1591
  • [7] Azadeh A(2005)Beam-ACO–hybridizing ant colony optimization with beam search: an application to open shop scheduling Comput Oper Res 32 1565-308
  • [8] Farahani MH(2004)An ant colony optimization algorithm for shop scheduling problems J Math Model Algorithms 3 285-375
  • [9] Torabzadeh S(1990)Job-shop scheduling with multi-purpose machines Computing 45 369-591
  • [10] Baghersad M(2016)A research survey: review of flexible job shop scheduling techniques Int Trans Oper Res 23 551-390