Show simple item record

dc.contributor.advisorTaner, Mehmet Rüştüen_US
dc.contributor.authorSevindik, Kayaen_US
dc.date.accessioned2016-07-01T11:04:48Z
dc.date.available2016-07-01T11:04:48Z
dc.date.issued2006
dc.identifier.urihttp://hdl.handle.net/11693/29777
dc.descriptionCataloged from PDF version of article.en_US
dc.description.abstractWithin a planning horizon, machines may become unavailable due to unexpected breakdowns or pre-scheduled activities. A realistic approach in constructing the production schedule should explicitly take into account such periods of unavailability. This study addresses the parallel machine-scheduling problem subject to availability constraints on each machine. The objectives of minimizing the total completion time and minimizing the maximum completion time are studied. The problems with both objectives are known to be NP-hard. We develop an exact branch-and-bound procedure and propose three heuristic algorithms for the total completion time problem. Similarly, we propose exact and approximation algorithms also for the maximum completion time problem. All proposed algorithms are tested through extensive computational experimentation, and several insights are provided based on computational results.en_US
dc.description.statementofresponsibilitySevindik, Kayaen_US
dc.format.extentx, 81 leavesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectSchedulingen_US
dc.subjectParallel Machinesen_US
dc.subjectTotal Completion Timeen_US
dc.subjectMakespanen_US
dc.subjectAvailability Constraintsen_US
dc.subjectHeuristicsen_US
dc.subject.lccT157.5 .S64 2006en_US
dc.subject.lcshProduction scheduling.en_US
dc.titleParallel machine scheduling subject to machine availability constraintsen_US
dc.typeThesisen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US
dc.identifier.itemidBILKUTUPB095569


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record