Beam search based algorithm for scheduling machines and AGVs in an FMS

Files

bilkent-research-paper.pdf (68.58 KB)

Date

1993

Authors

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
7
views
16
downloads

  • Share

Series

Abstract

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.

Source Title

Proceedings of the 2nd Industrial Engineering Research Conference, IERC 1993

Publisher

Institute for Industrial Engineers

Course

Other identifiers

Book Title

Keywords

Algorithms, Materials handling equipment, Production control, Scheduling, Beam search based scheduling algorithm, Finite buffer capacity, Materials handling routes, Rolling time windows, Sequences flexibilities, Flexible manufacturing systems

Degree Discipline

Degree Level

Degree Name

Citation

Permalink

http://hdl.handle.net/11693/27803

Published Version (Please cite this version)

Collections

Scholarly Publications - Industrial Engineering

Language

English

Type

Conference Paper