Show simple item record

dc.contributor.advisorGürler, Ülküen_US
dc.contributor.authorKolay, Muhammeten_US
dc.date.accessioned2016-01-08T18:19:36Z
dc.date.available2016-01-08T18:19:36Z
dc.date.issued2012
dc.identifier.urihttp://hdl.handle.net/11693/15506
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 leaves 62-64.en_US
dc.description.abstractIn this thesis, we study a two stage flow shop problem with a single server. All jobs are available for processing at time zero. Processing of a job is preceded by a sequence independent setup operation on both machines. The setup and processing times of all jobs on the two machines are given. All setups are performed by the same server who can perform one setup at a time. Setups cannot be performed simultaneously with job processing on the same machine. Once the setup is completed for a job, processing can automatically progress without any further need for the server. Setup for a job may start on the second machine before that job finishes its processing on the first machine. Preemption of setup or processing operations is not allowed. A job is completed when it finishes processing on the second machine. The objective is to schedule the setup and processing operations on the two machines in such a way that the total completion time is minimized. This problem is known to be strongly NP-hard [3]. We propose a new mixed integer programming formulation for small-sized instances and a Variable Neighborhood Search (VNS) mechanism for larger problems. We also develop several lower bounds to help assess the quality of heuristic solutions on large instances for which optimum solutions are not available. Experimental results indicate that the proposed heuristic provides reasonably effective solutions in a variety of instances and it is very efficient in terms of computational requirements.en_US
dc.description.statementofresponsibilityKolay, Muhammeten_US
dc.format.extentviii, 91 leaves, tablesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectmachine schedulingen_US
dc.subjectflow shopen_US
dc.subjectsingle setup serveren_US
dc.subjecttotal completion timeen_US
dc.subjectvariable neighborhood searchen_US
dc.subject.lccTS157.5 .K65 2012en_US
dc.subject.lcshScheduling (Management)--Mathematical models.en_US
dc.subject.lcshProduction control.en_US
dc.subject.lcshProduction scheduling.en_US
dc.subject.lcshProduction planning.en_US
dc.titleMinimazing the total completion time in a two stage flow shop with a single setup serveren_US
dc.typeThesisen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record