Disassembly line balancing problem with fixed number of workstations and finite supply

Download

index.pdf

Date

2010

Author

Göksoy, Eda

Metadata

Show full item record

Item Usage Stats

274
views

97
downloads

In this thesis, we consider a Disassembly Line Balancing Problem (DLBP) with fixed number of workstations. We aim to maximize the total value of the recovered parts. We assume that there is a limited supply for the products to be disassembled. Different components can be obtained by disassembling different units of the product. Our aim is to assign the tasks to the workstations of the disassembly line so as to maximize the total value of the recovered parts. We present several upper and one lower bounding procedure. The results of our computational study have revealed the satisfactory behavior of our bounding mechanisms.

Subject Keywords

Industrial engineering.

URI

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

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Assembly line balancing with multi-manned tasks Esin, Ceyhan Erdem; Kırca, Ömer; Department of Industrial Engineering (2007) In this thesis, we define a new problem area for assembly lines. In the literature, there are various studies on assembly line balancing, but none of them consider multi-manned tasks, task to which at least two operators have to be assigned. Two mathematical models and one constraint programming model are developed for both Type-I and Type-II ALB problems. The objective of Type-I problem is to minimize the number of stations whereas the objective of Type-II problem is to minimize the cycle time. In addition...
A heuristic approach for profit oriented disassembly lot-sizing problem Kaya, Melike; Bayındır, Zeynep Pelin; Çetinkaya, Ferda Can; Department of Industrial Engineering (2011) In this thesis, we work on adisassembly lot-sizing problem for multiple products with parts commonality,i.e., general product structure. We assume that supply of discarded products is infinite. When a product (or a subassembly) is disassembled, all its immediate child items are obtained,i.e., complete disassembly case.Intermediate and leaf items obtained are demandedbyexternal suppliers or remanufacturers. The maximum possible salesfor each intermediate and leaf item are known.Sales of the intermediate and ...
Optimal pricing and production decisions in reusable container systems Atamer, Büşra; Bakal, İsmail Serdar; Department of Industrial Engineering (2010) In this study, we focus on pricing and production decisions in reusable container systems with stochastic demand. We consider a producer that sells a single product to the customers in reusable containers with two supply options: (i) brand-new containers, (ii) returned containers from customers. Customers purchasing the products may return the containers to the producer to receive a deposit price. The return quantity depends on both customer demand and the deposit price determined by the producer. Hence, th...
Parallel-machine rescheduling with machine disruptions Azizoğlu, Meral (Informa UK Limited, 2005-12-01) In this study we consider a rescheduling problem on identical parallel machines. The rescheduling is undertaken because of a period of unavailability on one of the machines. We consider the total flow time as an efficiency measure and stability is gauged in terms of the number of jobs processed on different machines in the original and new schedules. We show that all efficient schedules with respect to efficiency and stability measures can be generated in polynomial time.
The budget constrained discrete time/cost trade-off problem in project networks Değirmenci, Güvenç; Azizoğlu, Meral; Department of Industrial Engineering (2008) The time/cost trade-off models in project management aim to compress the project completion time by accelerating the activity durations at an expense of additional resources. The budget problem in discrete time/cost trade-off scheduling selects the time/cost mode -among the discrete set of specified modes- for each activity so as to minimize the project completion time without exceeding the available budget. There may be alternative modes that solve the budget problem optimally, however each solution may ha...

Citation Formats

E. Göksoy, “Disassembly line balancing problem with fixed number of workstations and finite supply,” M.S. - Master of Science, Middle East Technical University, 2010.