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

Simple item page
dc.citation.epage312en_US
dc.citation.spage308en_US
dc.contributor.authorKarabük, S.en_US
dc.contributor.authorSabuncuoğlu, İhsanen_US
dc.coverage.spatialLos Angeles, California, USAen_US
dc.date.accessioned2016-02-08T12:02:04Zen_US
dc.date.available2016-02-08T12:02:04Zen_US
dc.date.issued1993en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.descriptionDate of Conference: 26 - 28 May 1993en_US
dc.descriptionConference Name: 2nd Industrial Engineering Research Conference, IERC 1993en_US
dc.description.abstractThis 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.en_US
dc.identifier.urihttp://hdl.handle.net/11693/27803en_US
dc.language.isoEnglishen_US
dc.publisherInstitute for Industrial Engineersen_US
dc.source.titleProceedings of the 2nd Industrial Engineering Research Conference, IERC 1993en_US
dc.subjectAlgorithmsen_US
dc.subjectMaterials handling equipmenten_US
dc.subjectProduction controlen_US
dc.subjectSchedulingen_US
dc.subjectBeam search based scheduling algorithmen_US
dc.subjectFinite buffer capacityen_US
dc.subjectMaterials handling routesen_US
dc.subjectRolling time windowsen_US
dc.subjectSequences flexibilitiesen_US
dc.subjectFlexible manufacturing systemsen_US
dc.titleBeam search based algorithm for scheduling machines and AGVs in an FMSen_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
bilkent-research-paper.pdf
Size:
68.58 KB
Format:
Adobe Portable Document Format
Download

Collections

Department of Industrial Engineering