mirage   mirage   mirage

Sequence-dependent group scheduling problem on unrelated-parallel machines

DSpace/Manakin Repository

Show simple item record

dc.creator Bozorgirad, Mir Abbas
dc.creator Logendran, Rasaratnam
dc.date.accessioned 2012-10-09T23:25:58Z
dc.date.available 2012-10-09T23:25:58Z
dc.date.issued 2012-08
dc.identifier.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 en_US
dc.identifier.uri http://hdl.handle.net/1957/34296
dc.description This is the author's peer-reviewed final manuscript, as accepted by the publisher. The published article is copyrighted by Elsevier and can be found at: http://www.journals.elsevier.com/expert-systems-with-applications/. en_US
dc.description.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. en_US
dc.description.sponsorship The research reported in this paper is funded in part by the National Science Foundation (USA) Grant no. CMMI-1029471. en_US
dc.language.iso en_US en_US
dc.publisher Elsevier en_US
dc.relation.ispartofseries Expert Systems with Applications en_US
dc.relation.ispartofseries Vol.39 no. 10 en_US
dc.subject Group scheduling en_US
dc.subject Unrelated-parallel machines en_US
dc.subject Bi-criteria en_US
dc.subject Sequence-dependent setup time en_US
dc.subject Mixed-integer linear programming en_US
dc.subject Tabu search en_US
dc.title Sequence-dependent group scheduling problem on unrelated-parallel machines en_US
dc.type Article en_US
dc.description.peerreview yes en_US
dc.identifier.doi 10.1016/j.eswa.2012.02.032


This item appears in the following Collection(s)

Show simple item record

Search ScholarsArchive@OSU


Advanced Search

Browse

My Account

Statistics