An efficient methodology for scheduling general flexible manufacturing systems Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/xp68kk07d

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Flexible Manufacturing Systems (FMSs) have evolved rapidly over the last decade. One important factor that influences the performance of FMS is scheduling. Scheduling in an FMS differs from that in a conventional job-shop because each operation of a job may be performed by any one of several machines. Most studies of scheduling in FMS in the past have assumed that each part has a unique process plan. However, in an actual manufacturing environment, it is possible for each part to have more than one process plan and each operation required of a part can be performed on alternative machines. In this thesis, the problem of scheduling parts in a General Flexible Manufacturing System (GFMS) in static environments is investigated when each part can have alternative process plans and each operation required of a part can be performed on alternative machines. The model and a solution algorithm have been developed for the problem. The mathematical model is formulated as the mixed-(binary) integer programming problem, and is proven NP-hard in the strong sense. An implicit-enumerative algorithm such as the branch-and-bound technique could not be used to find the optimal solution within a reasonable time even for a small-sized problem. The heuristic algorithm based on the concept known as tabu search is proposed to efficiently find the optimal/near-optimal solution for large-sized problems within a reasonable computational time. The steps involved with the heuristic algorithm and its application to an example problem are presented. Six different versions of tabu search-based heuristics (TSH 1-TSH 6) are compared to investigate the impact of using long-term memory and the use of fixed versus variable tabu-list sizes. A statistical experiment, based on randomized-block design, is carefully constructed to test the performance of the heuristics on 4 problem structures ranging from 4 parts to 14 parts. The results reveal that the tabu search-based heuristic with fixed tabu-list size and long-term memory (TSH 3) is preferred to other heuristics as the problem size increases. This research substantiates the fact that there is clearly a need for efficient heuristics to solve the complex scheduling problems in FMSs. One cannot rely on the implicit-enumerative procedure such as the branch-and-bound technique to solve problems that have practical significance.
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
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome, 8-bit Grayscale) using ScandAll PRO 1.8.1 on a Fi-6670 in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2012-11-05T20:30:23Z (GMT). No. of bitstreams: 1 SonthinenAdulwit1996.pdf: 4556019 bytes, checksum: 6cb5e73be5ef752d7a4ccd3bd3d245f0 (MD5) Previous issue date: 1995-11-21
  • description.provenance : Submitted by John Valentino (valentjo@onid.orst.edu) on 2012-11-03T00:24:25Z No. of bitstreams: 1 SonthinenAdulwit1996.pdf: 4556019 bytes, checksum: 6cb5e73be5ef752d7a4ccd3bd3d245f0 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-11-05T18:30:53Z (GMT) No. of bitstreams: 1 SonthinenAdulwit1996.pdf: 4556019 bytes, checksum: 6cb5e73be5ef752d7a4ccd3bd3d245f0 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-11-05T20:30:23Z (GMT) No. of bitstreams: 1 SonthinenAdulwit1996.pdf: 4556019 bytes, checksum: 6cb5e73be5ef752d7a4ccd3bd3d245f0 (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items