An analysis of FMS scheduling problem: a beam search based algorithm and comparison of scheduling schemes

Date
1994
Advisor
Sabuncuoglu, Ihsan
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Print ISSN
Electronic ISSN
Publisher
Bilkent University
Volume
Issue
Pages
Language
English
Type
Thesis
Journal Title
Journal ISSN
Volume Title
Series
Abstract

FMS scheduling procedures in the literature can be classified into on-line and off-line schemes according to the number of scheduling decisions made at a point in time. Online scheduling attempts to schedule operations one at a time when it is needed and off-line scheduling refers to scheduling operations of available jobs for the entire scheduling period. In the literature there is no unified argument for or against either of these scheduling schemes. This research has two main objectives: development of a new scheduling scheme called quasi on-line that makes a trade-off between on-line and off-line schemes and comparison of the proposed scheme with others under various experimental conditions. A new algorithm is proposed on which the quasi online scheme is based. The proposed algorithm is a heuristic and utilizes a beam search technique. It considers finite buffer capacity, routing and sequence flexibilities and generates machine and AGV schedules for a given scheduling period. A simulation model is also developed to implement and test scheduling schemes.

Course
Other identifiers
Book Title
Keywords
Flexible Manufacturing Systems, simulation, scheduling
Citation
Published Version (Please cite this version)