A flexible flowshop problem with total flow time minimization

Date

2001-08-01

Author

Azizoğlu, Meral
Kondakci, S

Metadata

Show full item record

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

Item Usage Stats

242
views

0
downloads

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.

Subject Keywords

Management Science and Operations Research, Modelling and Simulation, Information Systems and Management

URI

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

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

DOI

https://doi.org/10.1016/s0377-2217(00)00142-9

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

A Lagrangean relaxation approach for the mixed-model flow line sequencing problem Eliiyi, Deniz Tuersel; Oezlen, Melih (Elsevier BV, 2008-03-01) 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 a...
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...
A conic quadratic formulation for a class of convex congestion functions in network flow problems Gürel, Sinan (Elsevier BV, 2011-06-01) In this paper we consider a multicommodity network flow problem with flow routing and discrete capacity expansion decisions. The problem involves trading off congestion and capacity assignment (or expansion) costs. In particular, we consider congestion costs involving convex, increasing power functions of flows on the arcs. We first observe that under certain conditions the congestion cost can be formulated as a convex function of the capacity level and the flow. Then, we show that the problem can be effici...
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...
A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems Chung, Chia-Shin; Flynn, James; Kırca, Ömer (Elsevier BV, 2006-10-01) The m-machine permutation flowshop problem with the total tardiness objective is a common scheduling problem, which is known to be NP-hard. Here, we develop a branch and bound algorithm to solve this problem. Our algorithm incorporates a machine-based lower bound and a dominance test for pruning nodes. We undertake a numerical study that evaluates our algorithm and compares it with the best alternative existing algorithm. Extensive computational experiments indicate that our algorithm performs better and ca...

Citation Formats

M. Azizoğlu and S. Kondakci, “A flexible flowshop problem with total flow time minimization,” EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, pp. 528–538, 2001, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36349.