Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems
Date
2006-10-01
Author
Chung, Chia-Shin
Flynn, James
Kırca, Ömer
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
212
views
0
downloads
Cite This
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 can handle test problems with n <= 20.
Subject Keywords
Management Science and Operations Research
,
Modelling and Simulation
,
Information Systems and Management
URI
https://hdl.handle.net/11511/41897
Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
DOI
https://doi.org/10.1016/j.ejor.2004.12.023
Collections
Graduate School of Natural and Applied Sciences, Article
Suggestions
OpenMETU
Core
A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems
Chung, CS; Flynn, J; Kirca, O (Elsevier BV, 2002-10-11)
The m-machine permutation flowshop problem with the total flow-time objective is a common scheduling problem, which is known to be NP-hard for m greater than or equal to 2. In this article, we develop a branch and bound algorithm to solve both the weighted and unweighted version of this problem. Our algorithm incorporates a new machine-based lower bound and a dominance test for pruning nodes. Computational experiments suggest that the algorithm can handle test problems with n less than or equal to 15. It al...
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...
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 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...
Multi-objective integer programming: A general approach for generating all non-dominated solutions
Oezlen, Melih; Azizoğlu, Meral (Elsevier BV, 2009-11-16)
In this paper we develop a general approach to generate all non-dominated solutions of the multi-objective integer programming (MOIP) Problem. Our approach, which is based on the identification of objective efficiency ranges, is an improvement over classical epsilon-constraint method. Objective efficiency ranges are identified by solving simpler MOIP problems with fewer objectives. We first provide the classical epsilon-constraint method on the bi-objective integer programming problem for the sake of comple...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
C.-S. Chung, J. Flynn, and Ö. Kırca, “A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems,”
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
, pp. 1–10, 2006, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/41897.