Sequence-dependent group scheduling problem on unrelated-parallel machines Public Deposited

http://ir.library.oregonstate.edu/concern/defaults/k930bx587

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/.

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • 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.
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
Series
Keyword
Rights Statement
Funding Statement (additional comments about funding)
Publisher
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Deanne Bruner(deanne.bruner@oregonstate.edu) on 2012-10-09T23:25:58Z (GMT) No. of bitstreams: 1 LogendranRasaratnamMechanicalIndustrialManufacturingEngineeringSequenceDependentGroup.pdf: 181087 bytes, checksum: 8c3a75500a6eee83aa70066faa7169eb (MD5)
  • description.provenance : Submitted by Deanne Bruner (deanne.bruner@oregonstate.edu) on 2012-10-09T23:06:33Z No. of bitstreams: 1 LogendranRasaratnamMechanicalIndustrialManufacturingEngineeringSequenceDependentGroup.pdf: 181087 bytes, checksum: 8c3a75500a6eee83aa70066faa7169eb (MD5)
  • description.provenance : Made available in DSpace on 2012-10-09T23:25:58Z (GMT). No. of bitstreams: 1 LogendranRasaratnamMechanicalIndustrialManufacturingEngineeringSequenceDependentGroup.pdf: 181087 bytes, checksum: 8c3a75500a6eee83aa70066faa7169eb (MD5) Previous issue date: 2012-08

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items