Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan

Date

2004-09-01

Author

Toktaş, Berkin
Azizoğlu, Meral
Köksalan, Suna Kondakci

Metadata

Show full item record

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

Item Usage Stats

207
views

0
downloads

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 solving problems with up to 25 jobs and the heuristic procedure produces approximate efficient solutions that are very close to exact efficient solutions in very small computation times.

Subject Keywords

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

URI

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

Journal

European Journal of Operational Research

DOI

https://doi.org/10.1016/s0377-2217(03)00192-9

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.
Small Response Surface Designs for Metamodel Estimation Batmaz, İnci (Elsevier BV, 2003-01-01) The primary objective of this study is to provide the novice researchers in simulation metamodeling with guidance on how to use small designs for metamodel estimation especially when cost effectiveness is a concern. This study was carried out in three phases: First, a group of second-order small designs were evaluated with respect to various criteria. Next, the metamodel of a time-shared computer system was estimated using these designs. Finally, the predictive capabilities of these small designs in giving ...
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 NEW HEURISTIC APPROACH FOR THE MULTIITEM DYNAMIC LOT-SIZING PROBLEM KIRCA, O; KOKTEN, M (Elsevier BV, 1994-06-09) In this paper a framework for a new heuristic approach for solving the single level multi-item capacitated dynamic lot sizing problem is presented. The approach uses an iterative item-by-item strategy for generating solutions to the problem. In each iteration a set of items are scheduled over the planning horizon and the procedure terminates when all items are scheduled. An algorithm that implements this approach is developed in which in each iteration a single item is selected and scheduled over the planni...

Citation Formats

B. Toktaş, M. Azizoğlu, and S. K. Köksalan, “Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan,” European Journal of Operational Research, pp. 286–295, 2004, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/46261.