A Lagrangean relaxation approach for the mixed-model flow line sequencing problem

Date

2008-03-01

Author

Eliiyi, Deniz Tuersel
Oezlen, Melih

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

205
views

0
downloads

In this study, a mixed-model flow line sequencing problem is considered. A mixed-model flow line is a special case of production line where products are transported on a conveyor belt, and different models of the same product are intermixed on the same line. We have focused on product-fixed, rate-synchronous lines with variable launching. Our objective function is minimizing makespan. A heuristic algorithm based on Lagrangean relaxation is developed for the problem, and tested in terms of solution quality and computational efficiency.

Subject Keywords

Management Science and Operations Research, Modelling and Simulation, General Computer Science

URI

https://hdl.handle.net/11511/65703

Journal

COMPUTERS & OPERATIONS RESEARCH

DOI

https://doi.org/10.1016/j.cor.2006.05.011

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

A flexible flowshop problem with total flow time minimization Azizoğlu, Meral; Kondakci, S (Elsevier BV, 2001-08-01) In this study, we consider total flow time problem in a flexible flowshop environment. We develop a branch and bound algorithm to find the optimal schedule. The efficiency of the algorithm is enhanced by upper and lower bounds and a dominance criterion. Computational experience reveals that the algorithm solves moderate sized problems in reasonable solution times.
A metamodeling methodology involving both qualitative and quantitative input factors Tunali, S; Batmaz, I (Elsevier BV, 2003-10-16) This paper suggests a methodology for developing a simulation metamodel involving both quantitative and qualitative factors. The methodology mainly deals with various strategic issues involved in metamodel estimation, analysis, comparison, and validation. To illustrate how to apply the methodology, a regression metamodel is developed for a client-server computer system. In particular, we studied how the response time is affected by the quantum interval, the buffer size. and the total number of terminals whe...
An interactive sorting method for additive utility functions Koeksalan, Murat; Oezpeynirci, Selin Bilgin (Elsevier BV, 2009-09-01) In this paper, we consider the problem of placing alternatives that are defined by multiple criteria into preference-ordered categories. We consider a method that estimates an additive utility function and demonstrate that it may misclassify many alternatives even when substantial preference information is obtained from the decision maker (DM) to estimate the function. To resolve this difficulty, we develop an interactive approach. Our approach occasionally requires the DM to place some reference alternativ...
Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan Toktaş, Berkin; Azizoğlu, Meral; Köksalan, Suna Kondakci (Elsevier BV, 2004-09-01) In this study we address the problem of minimizing makespan and maximum earliness simultaneously in a two-machine flow shop environment. We develop a branch-and-bound procedure that generates all efficient solutions with respect to two criteria. We propose several lower and upper bounding schemes to enhance the efficiency of the algorithm. We also propose a heuristic procedure that generates approximate efficient solutions. Our computational results reveal that the branch-and-bound procedure is capable of s...
The multi-resource agent bottleneck generalised assignment problem Karsu, Ozlem; Azizoğlu, Meral (Informa UK Limited, 2012-01-01) In this study, we consider the multi resource agent bottleneck generalised assignment problem. Our aim is to minimise the maximum load over all agents. We take our motivation from an assignment problem faced in heating, ventilating and air conditioning sector. We study the linear programming (LP) relaxation of the problem. We use the optimal LP relaxation solutions in our branch and bound algorithm while defining bounding and branching schemes. We find that our branch and bound algorithm returns optimal sol...

Citation Formats

D. T. Eliiyi and M. Oezlen, “A Lagrangean relaxation approach for the mixed-model flow line sequencing problem,” COMPUTERS & OPERATIONS RESEARCH, pp. 933–943, 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65703.