Sequence-dependent group scheduling problem on unrelated-parallel machines
- 作者：Mir Abbas Bozorgirad bozorgim@onid.orst.edu ; Rasaratnam Logendran ; Logen.Logendran@oregonstate.edu
- 关键词：Group scheduling ; Unrelated-parallel machines ; Bi-criteria ; Sequence-dependent setup time ; Mixed-integer linear programming ; Tabu search
- 刊名：Expert Systems with Applications
- 出版年：2012
- 期刊代码：62_09574174
- 类别：et
- 出版时间：August, 2012
- 卷：39
- 期：10
- 页码：9021-9030
- 文件大小：265 K
摘要
In this research we address a sequence-dependent group scheduling problem on a set of unrelated-parallel machines where the run time of each job differs on different machines. To benefit both producer and customers we attempt to minimize a linear combination of total weighted completion time and total weighted tardiness. Since the problem is shown to be NP-hard, meta-heuristic algorithms based on tabu search are developed to find the optimal/near optimal solution. For some small size yet complex problems, the results from these algorithms are compared to the optimal solutions found by CPLEX. The result obtained in all of these problems is that the tabu search algorithms could find solutions at least as good as CPLEX but in drastically shorter computational time, thus signifying the high degree of efficiency and efficacy attained by the former.