Non-permutation flowshop scheduling in a supply chain with sequence-dependent setup times Public Deposited

http://ir.library.oregonstate.edu/concern/defaults/2z10wq661

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/international-journal-of-production-economics/.

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • In this paper, we consider a flowshop scheduling problem with sequence-dependent setup times and a bicriteria objective to minimize the work-in-process inventory for the producer and to maximize the customers' service level. The use of a bicriteria objective is motivated by the fact that successful companies in today's environment not only try to minimize their own cost but also try to fulfill their customers' need. Two main approaches, permutation and non-permutation schedules, are considered in finding the optimal schedule for a flowshop. In permutation schedules the sequence of jobs remains the same on all machines whereas in non-permutation schedule, jobs can have different sequence on different machines. A linear mathematical model for solving the non-permutation flowshop is developed to comply with all of the operational constraints commonly encountered in the industry, including dynamic machine availabilities, dynamic job releases, and the possibility of jobs skipping one or more machines, should their operational requirements deem that it was necessary. As the model is shown to be NP-hard, a metasearch heuristic, employing a newly developed concept known as the Tabu search with embedded progressive perturbation (TSEPP) is developed to solve, in particular, industry-size problems efficiently. The effectiveness and efficiency of the search algorithm are assessed by comparing the search algorithmic solutions with that of the optimal solutions obtained from CPLEX in solvable small problem instances.
Resource Type
DOI
Date Available
Date Issued
Citation
  • Mehravaran, Y., & Logendran, R. (2012). Non-permutation flowshop scheduling in a supply chain with sequence-dependent setup times. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 135(2), 953-963. doi: 10.1016/j.ijpe.2011.11.011
Series
Keyword
Rights Statement
Funding Statement (additional comments about funding)
Publisher
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2012-10-16T17:25:34Z (GMT). No. of bitstreams: 1 LogendranRasaratnamMechanicalIndustrialManufacturingEngineeringNonPermutationFlowshopScheduling.pdf: 211765 bytes, checksum: 3654ab000e95baedd4ef09e3e337ce81 (MD5) Previous issue date: 2012-02
  • description.provenance : Approved for entry into archive by Deanne Bruner(deanne.bruner@oregonstate.edu) on 2012-10-16T17:25:34Z (GMT) No. of bitstreams: 1 LogendranRasaratnamMechanicalIndustrialManufacturingEngineeringNonPermutationFlowshopScheduling.pdf: 211765 bytes, checksum: 3654ab000e95baedd4ef09e3e337ce81 (MD5)
  • description.provenance : Submitted by Deanne Bruner (deanne.bruner@oregonstate.edu) on 2012-10-16T00:05:29Z No. of bitstreams: 1 LogendranRasaratnamMechanicalIndustrialManufacturingEngineeringNonPermutationFlowshopScheduling.pdf: 211765 bytes, checksum: 3654ab000e95baedd4ef09e3e337ce81 (MD5)

Relationships

In Administrative Set:
Last modified: 07/08/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items