A Branch and bound algorithm to minimize total weighted flowtime for the two-stage assembly scheduling problem

Download
082790.pdf
1999
Tozkapan, Ali
Show full item record
42
views
0
downloads
https://hdl.handle.net/11511/2289
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
Tozkapan, A; Kirca, O; Chung, CS (2003-02-01)
In this paper, a two-stage assembly scheduling problem is considered with the objective of minimizing the total weighted flowtime. A lower bounding procedure and a dominance criterion are developed and incorporated into a branch and bound procedure. A heuristic procedure is also used to derive an initial upper bound. Computational results of the algorithm are presented.
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 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...
A polynomially bounded dual simplex algorithm for the capaciated minimum cost flow problem
Altaban, Ayşegül; Sepil, Canan; Department of Industrial Engineering (1990)
A multi-phase heuristic for the production routing problem
Solyali, Oguz; Süral, Haldun (2017-11-01)
This study considers the production routing problem where a plant produces and distributes a single item to multiple retailers over a multi-period time horizon. The problem is to decide on when and how much to produce and stock at the plant, when and how much to serve and stock at each retailer, and vehicle routes for shipments such that the sum of fixed production setup cost, variable production cost, distribution cost, and inventory carrying cost at the plant and retailers is minimized. A multi-phase heur...
Citation Formats
A. Tozkapan, “A Branch and bound algorithm to minimize total weighted flowtime for the two-stage assembly scheduling problem,” Middle East Technical University, 1999.
METU IIS - Integrated Information Service open@metu.edu.tr