Integrated machine-scheduling and inventory planning of door manufacturing operations at OYAK Renault factory

Simple item page
buir.advisorŞen, Alper
dc.contributor.authorBozkaya, Nurcan
dc.date.accessioned2016-01-08T18:22:54Z
dc.date.available2016-01-08T18:22:54Z
dc.date.issued2012
dc.departmentDepartment of Industrial Engineeringen_US
dc.descriptionAnkara : The Department of Industrial Engineering and the Graduate School of Engineering and Science of Bilkent University, 2012.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2012.en_US
dc.descriptionIncludes bibliographical references.en_US
dc.description.abstractA car passes through press, body shell, painting and assembly stages during its manufacturing process. Due to the increased competition among car manufacturers, they aim to continuously advance and improve their processes. In this study, we analyze planning operations for the production of front/back and left/right doors in body shell department of Bursa Oyak-Renault factory and propose heuristic algorithms to improve their planning processes. In this study, we present four different mathematical models and two heuristics approaches which decrease the current costs of the company particularly with respect to inventory carrying and setup perspectives. In the body shell department of the company, there are two parallel manufacturing cells which produces doors to be assembled on the consumption line. The effective planning and scheduling of the jobs on these lines requires solving the problem of integrated machine-scheduling and inventory planning subject to inclusive eligibility constraints and sequence independent setup times with job availability in flexible manufacturing cells of the body shell department. The novelty in the models lie in the integration of inventory planning and production scheduling decisions with the aim of streamlining operations of the door manufacturing cells with the consumption line. One of the proposed heuristic approaches is Rolling Horizon Algorithm (RHA) which divides the planning horizon into sub-intervals and solves the problem by rolling the solutions through sub-intervals. The other proposed algorithm is Two-Pass Algorithm which divides the planning horizon into sub-intervals and solves each sub-problem in each sub-interval to optimality for two times by maintaining the starting and ending inventory levels feasible. These approaches are implemented with Gurobi optimization software and Java programming language and applied within a decision support system that supports daily planning activities.en_US
dc.description.degreeM.S.en_US
dc.description.statementofresponsibilityBozkaya, Nurcanen_US
dc.format.extentxv, 101 leavesen_US
dc.identifier.urihttp://hdl.handle.net/11693/15680
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectDecision Support System,en_US
dc.subjectIntegrated Manufacturing Systemen_US
dc.subjectproduction planning and schedulingen_US
dc.subjectcar manufacturingen_US
dc.subject.lccTS183 .B69 2012en_US
dc.subject.lcshManufacturing processes--Mathematical models.en_US
dc.subject.lcshScheduling (Management)en_US
dc.subject.lcshProduction scheduling.en_US
dc.subject.lcshInventory control--Mathematical models.en_US
dc.subject.lcshInventory policy--Mathematical models.en_US
dc.subject.lcshProduction planning.en_US
dc.subject.lcshAutomobile industry and trade.en_US
dc.titleIntegrated machine-scheduling and inventory planning of door manufacturing operations at OYAK Renault factoryen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
0006396.pdf
Size:
3.8 MB
Format:
Adobe Portable Document Format
Download
Collections
Dept. of Industrial Engineering - Master's degree