Workload smoothing in assembly lines

Download

index.pdf

Date

2014

Author

İmat, Sadullah

Metadata

Show full item record

Item Usage Stats

197
views

363
downloads

In this thesis, we consider a simple assembly line balancing problem with fixed number of workstations and predefined cycle time. Our objective is to minimize the sum of the squared deviations of the workstation loads from the cycle time. We first present pure integer nonlinear programming model and then convert the model into mixed integer linear program. We develop several optimality properties and bounding mechanisms, and use them in our branch and bound algorithm. The results of our computational study reveal that our branch and bound algorithm is capable of solving medium sized problem instances in reasonable times.

Subject Keywords

Assembly-line methods., Production scheduling., Manufacturing processes., Production engineering.

URI

http://etd.lib.metu.edu.tr/upload/12618229/index.pdf
https://hdl.handle.net/11511/24239

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Workload smoothing in simple assembly line balancing Azizoğlu, Meral (2018-01-01) This paper considers a simple assembly line balancing problem with fixed number of workstations and prespecified cycle time. Our objective is to minimize the sum of the squared deviations of the workstation loads around the cycle time, hence maintain workload smoothing. We develop several optimality properties and bounding mechanisms, and use them in our branch and bound algorithm. The results of our computational study reveal that our branch and bound algorithm is capable of solving medium sized problem in...
A rescheduling problem with controllable processing times:trade-off between number of disrupted jobs and reschedulingcosts Cincioğlu, Derya; Gürel, Sinan; Department of Industrial Engineering (2011) In this thesis, we consider a rescheduling problem on non-identical parallel machines with controllable processing times. A period of unavailability occurs on one of the machines due to a machine failure, material shortage or broken tool. These disruptions may cause the original schedule to become ine cient and sometimes infeasible. In order to generate a new and feasible schedule, we are dealing with two conflicting measures called the e ciency and stability measures simultaneously. The e ciency measure ev...
Rebalancing of assembly lines Sancı, Ece; Azizoğlu, Meral; Department of Industrial Engineering (2015) In this study, we consider an assembly line rebalancing problem. We assume that there is a disruption on one or more workstations that makes the current solution infeasible. After the disruption, we aim to find a rebalance so as to catch the trade-off between the efficiency measure of cycle time and the stability measure of number of tasks assigned to different workstations in the original and new solutions. We generate all nondominated objective vectors with respect to our efficiency and stability measures...
Profit-oriented disassembly line balancing with stochastic task times in hybrid lines Gümüşkaya, Volkan; Bayındır, Zeynep Pelin; Altekin, Tevhide; Department of Industrial Engineering (2013) We offer a solution approach for profit-oriented disassembly line balancing problem in hybrid lines with stochastic task times. When task times are stochastic, there is a probability that some of the tasks are not completed within the predefined cycle time. For task incompletions, the most commonly used remedial actions are stopping the line or offline repairs. Stopping the line is to stop the line until the incomplete tasks are completed, while in offline repair, incomplete tasks are completed in an offlin...
Assembly Line Balancing with Task Paralleling Kaplan, Özlem; Özdemirel, Nur Evin; Department of Industrial Engineering (2004) In this study, we consider single model deterministic Assembly Line Balancing problem with task paralleling. The objective is to minimize the total cost which is composed of station opening cost and task dependent equipment cost. A branch and bound algorithm that allows two-level task paralleling is proposed. A heuristic algorithm is also developed both for obtaining efficient upper bounds to branch and bound and for achieving good approximate solutions for large sized problems. Computational experiments ar...

Citation Formats

S. İmat, “Workload smoothing in assembly lines,” M.S. - Master of Science, Middle East Technical University, 2014.