Bi-criteria group scheduling with sequence-dependent setup time in a flow shop Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/8w32r7589

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Cellular manufacturing, which is also referred to as group technology among researchers, has primarily been used as a means to increase productivity, efficiency and flexibility. Under group technology, similar jobs, which have similar shape, material, and processing operations are assigned to the same group. Moreover, dissimilar machines are assigned to the same cell to meet the processing requirements of jobs in a group or multiple groups. Group scheduling problems have been studied extensively in the past as implementation of group technology became more prevalent in industry. However, most of the work that has been done has focused on single-criterion optimization. A bi-criteria group scheduling problem in a flow shop with sequence-dependent setup time is investigated in this research. Cellular manufacturing and flow shop are two popular scenarios in industry. To mimic real industry practice, dynamic job releases and dynamic machine availabilities are assumed. The goal is to minimize the weighted sum of total weighted completion time and total weighted tardiness, which satisfy the producer and customer goals separately. Normalized weights are assigned to both criteria to describe the trade-off between the two goals. Two different initial solution finding mechanisms are proposed, and a tabu-search based two-level search algorithm is developed to find near optimal solutions for the problem. An example problem is used to demonstrate the applicability of the search algorithm. A mathematical model is developed and implemented to evaluate the quality of the solutions obtained from the heuristics in small problem instances. Further, to uncover the difference in performance of initial solution finding mechanisms and heuristics, a detailed experimental design is performed. The results show that different heuristics have different performance in solving problems generated with different parameters.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2012-01-10T23:56:53Z (GMT). No. of bitstreams: 3 THESIS OF Andy Clean.Dec111.pdf: 2799226 bytes, checksum: 6c1cd91061fe05a8a953148a3fd96d94 (MD5) license_rdf: 21598 bytes, checksum: 63ac3618e43cabfadfd475d2f642ca65 (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2011-11-21
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2012-01-10T23:56:53Z (GMT) No. of bitstreams: 3 THESIS OF Andy Clean.Dec111.pdf: 2799226 bytes, checksum: 6c1cd91061fe05a8a953148a3fd96d94 (MD5) license_rdf: 21598 bytes, checksum: 63ac3618e43cabfadfd475d2f642ca65 (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2012-01-10T21:56:43Z (GMT) No. of bitstreams: 3 THESIS OF Andy Clean.Dec111.pdf: 2799226 bytes, checksum: 6c1cd91061fe05a8a953148a3fd96d94 (MD5) license_rdf: 21598 bytes, checksum: 63ac3618e43cabfadfd475d2f642ca65 (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
  • description.provenance : Submitted by Dongchen Lu (lud@onid.orst.edu) on 2012-01-05T06:08:19Z No. of bitstreams: 3 THESIS OF Andy Clean.Dec111.pdf: 2799226 bytes, checksum: 6c1cd91061fe05a8a953148a3fd96d94 (MD5) license_rdf: 21598 bytes, checksum: 63ac3618e43cabfadfd475d2f642ca65 (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)

Relationships

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

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items