Article
 

Sequence-dependent group scheduling problem on unrelated-parallel machines

公开 Deposited

可下载的内容

下载PDF文件
https://ir.library.oregonstate.edu/concern/articles/k930bx587

Descriptions

Attribute NameValues
Creator
Abstract
  • 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.
  • Keywords: Bi-criteria, Group scheduling, Sequence-dependent setup time, Mixed-integer linear programming, Unrelated-parallel machines, Tabu search
Resource Type
DOI
Date Available
Date Issued
Citation
  • Bozorgirad, M., & Logendran, R. (2012). Sequence-dependent group scheduling problem on unrelated-parallel machines. EXPERT SYSTEMS WITH APPLICATIONS, 39(10), 9021-9030. doi: 10.1016/j.eswa.2012.02.032
Journal Title
Journal Volume
  • 39
Journal Issue/Number
  • 10
权利声明
Funding Statement (additional comments about funding)
  • The research reported in this paper is funded in part by the National Science Foundation (USA) Grant no. CMMI-1029471.
Publisher
Peer Reviewed
Language
Replaces

关联

Parents:

This work has no parents.

单件

缩略图 标题 上传日期 公开度 行动
file details LogendranRasaratnamMechanicalIndustrialManufacturingEngineeringSequenceDependentGroup.pdf 2017-07-08 公开 下载