Integrated scheduling of production and logistics operations of a multi-plant manifacturer serving a single customer area

Simple item page
buir.advisorTaner, Mehmet Rüştü
dc.contributor.authorÇelen, Merve
dc.date.accessioned2016-01-08T18:10:45Z
dc.date.available2016-01-08T18:10:45Z
dc.date.issued2009
dc.departmentDepartment of Industrial Engineeringen_US
dc.descriptionAnkara : The Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent University, 2009.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2009.en_US
dc.descriptionIncludes bibliographical references leaves 129-132.en_US
dc.description.abstractIncreasing market competition forces manufacturers to continuously reduce their leadtimes by minimizing the total time spent in both production and distribution. Some studies in the relevant literature indicate that scheduling production and logistics operations in a coordinated manner leads to improved results. This thesis studies the problem of scheduling production and distribution operations of a manufacturer serving a single customer area from multiple identical production plants dispersed at different geographical locations. The products are transported to the customer area by a single capacitated truck. The setting is inspired by the operations of a leading soft drink manufacturer, and the objective is set in line with their needs as the minimization of the total completion time of the jobs. The completion time of a job is defined as the time it reaches at the customer area. We consider both this general problem and four special cases motivated by common practical applications. We prove that both the main problem and three of its special cases are NP-hard at least in the ordinary sense. We develop mixed integer programming (MIP) models for all these problems and propose a pseudo-polynomial dynamic programming mechanism for the remaining special case. Since the MIP models are able to provide optimal solutions only for small instances in a reasonable amount of time, heuristics are also proposed to solve larger instances. Fast lower bounds are developed to facilitate the performance assessment of these heuristics in medium and large instances. Evidence from extensive computational experimentation suggests that the proposed heuristics are both efficient and effective.en_US
dc.description.degreeM.S.en_US
dc.description.statementofresponsibilityÇelen, Merveen_US
dc.format.extentxix, 356 leaves, tablesen_US
dc.identifier.urihttp://hdl.handle.net/11693/14906
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectMulti-plant schedulingen_US
dc.subjectdistributionen_US
dc.subjectcomplexityen_US
dc.subjectinteger programmingen_US
dc.subjectheuristicen_US
dc.subject.lccTS157.5 .C45 2009en_US
dc.subject.lcshProduction scheduling.en_US
dc.titleIntegrated scheduling of production and logistics operations of a multi-plant manifacturer serving a single customer areaen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
0003858.pdf
Size:
1.65 MB
Format:
Adobe Portable Document Format
Download
Collections
Dept. of Industrial Engineering - Master's degree