Show simple item record

dc.contributor.authorGören, S.en_US
dc.contributor.authorSabuncuoğlu, İhsanen_US
dc.coverage.spatialNashville, TN, USAen_US
dc.date.accessioned2016-02-08T11:40:56Zen_US
dc.date.available2016-02-08T11:40:56Zen_US
dc.date.issued2007en_US
dc.identifier.urihttp://hdl.handle.net/11693/26971en_US
dc.descriptionDate of Conference: 19-23 May 2007en_US
dc.descriptionConference Name: 16th Industrial Engineering Research Conference, IERC 2007en_US
dc.description.abstractThe vast majority of the machine scheduling research assumes complete information about the scheduling problem and a static environment in which scheduling systems operate. In practice, however, scheduling systems are subject to considerable uncertainty in dynamic environments. The ability to cope with the uncertainty in scheduling process is becoming increasingly important in today's highly dynamic and competitive business environments. In the literature, two approaches have appeared as the effective way: reactive and proactive scheduling. The objective in reactive scheduling is to revise schedules as necessary, while proactive scheduling attempts to incorporate future disruptions when generating schedules. In this paper we take a proactive scheduling approach to solve a machine scheduling problem with two sources of uncertainty: processing time variability and machine breakdowns. We define two robustness measures and develop a heuristic based on beam search methodology to optimize them. The computational results show that the proposed algorithms perform significantly better than a number of heuristics available in the literature.en_US
dc.language.isoEnglishen_US
dc.source.titleProceedings of the 16th Industrial Engineering Research Conference, IERC 2007en_US
dc.subjectProactive schedulingen_US
dc.subjectDynamical systemsen_US
dc.subjectEvolutionary algorithmsen_US
dc.subjectHeuristic methodsen_US
dc.subjectHeuristic programmingen_US
dc.subjectIndustrial engineeringen_US
dc.subjectIndustrial researchen_US
dc.subjectInteger programmingen_US
dc.subjectLearning algorithmsen_US
dc.subjectMachine shop practiceen_US
dc.subjectOptimizationen_US
dc.subjectProduction controlen_US
dc.subjectProject managementen_US
dc.subjectSystems engineeringen_US
dc.subjectBeam searchen_US
dc.subjectCompetitive businessen_US
dc.subjectComplete informationen_US
dc.subjectComputational resultsen_US
dc.subjectDynamic environmentsen_US
dc.subjectMachine-scheduling problemsen_US
dc.subjectReactive schedulingen_US
dc.subjectRobustness measuresen_US
dc.subjectScheduling problemsen_US
dc.subjectScheduling processen_US
dc.subjectScheduling systemsen_US
dc.titleA beam search algorithm to optimize robustness under random machine breakdowns and processing time variabilityen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.publisherInstitute of Industrial Engineersen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record