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

Authors:
Ali Tozkapan;Ömer Kirca;Chia-Shin Chung
Affiliations:
Department of Industrial Engineering, Middle East Technical University, Ankara 06531, Turkey;Department of Industrial Engineering, Middle East Technical University, Ankara 06531, Turkey;Department of Operations Management and Business Statistics, 1860 East 18th Street, Cleveland State University, Cleveland, OH
Venue:
Computers and Operations Research
Year:
2003

Citing 2
Cited 8

Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem

Management Science
Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times

Computers and Operations Research

A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application

Computers and Operations Research
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm

Expert Systems with Applications: An International Journal
The two-stage assembly scheduling problem to minimize total completion time with setup times

Computers and Operations Research
A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application

Computers and Operations Research
Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop

Advances in Engineering Software
Assembly flowshop scheduling problem to minimize total tardiness

AMERICAN-MATH'12/CEA'12 Proceedings of the 6th WSEAS international conference on Computer Engineering and Applications, and Proceedings of the 2012 American conference on Applied Mathematics
Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs

Computers and Operations Research
Minimizing the total completion time in a distributed two stage assembly system with setup times

Computers and Operations Research

Quantified Score

Hi-index	0.02

Visualization

Abstract

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.