Browsing by Subject "Finite buffer capacity"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Beam search based algorithm for scheduling machines and AGVs in an FMS
    (Institute for Industrial Engineers, 1993) Karabük, S.; Sabuncuoğlu, İhsan
    This paper presents a beam search based scheduling algorithm for a random FMS. The proposed algorithm considers finite buffer capacity, routing and sequence flexibilities and generates machine and AGV schedules in varying time windows. The performance of the algorithm is measured using makespan, flow time, and tardiness criteria under various experimental conditions.
  • Thumbnail Image
    ItemOpen Access
    A beam search-based algorithm and evaluation of scheduling approaches for fexible manufacturing systems
    (Taylor & Francis, 1998) Sabuncuoglu İ.; Karabuk, S.
    This paper presents a new algorithm for the flexible manufacturing system (FMS) scheduling problem. The proposed algorithm is a heuristic based on filtered beam search. It considers finite buffer capacity, routing and sequence flexibilities and generates machine and automated guided vehicle (AGV) schedules for a given scheduling period. A new deadlock resolution mechanism is also developed as an integral part of the proposed algorithm. The performance of the algorithm is compared with several machine and AGV dispatching rules using mean flow time, mean tardiness and makespan criteria. It is also used to examine the effects of scheduling factors (i.e., machine and AGV load levels, routing and sequence flexibilities, etc.) on the system performance. The results indicate thai the proposed scheduling algorithm yields considerable improvements in system performance over dispatching rules under a wide variety of experimental conditions. © 1998 "IIE".