The two-stage assembly scheduling problem to minimize total completion time with setup times

Authors:
Ali Allahverdi;Fawaz S. Al-Anzi
Affiliations:
Department of Industrial and Management Systems Engineering, Kuwait University, P.O. Box 5969, Safat, Kuwait;Department of Computer Engineering, Kuwait University, P.O. Box 5969, Safat, Kuwait
Venue:
Computers and Operations Research
Year:
2009

Citing 4
Cited 3

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

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

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
Self-adaptive differential evolution

CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I

Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop

Advances in Engineering Software
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.01

Visualization

Abstract

We address the two-stage assembly scheduling problem where there are m machines at the first stage and an assembly machine at the second stage. The objective is to schedule the available n jobs so that total completion time of all n jobs is minimized. Setup times are treated as separate from processing times. This problem is NP-hard, and therefore we present a dominance relation and propose three heuristics. The heuristics are evaluated based on randomly generated data. One of the proposed heuristics is known to be the best heuristic for the case of zero setup times while another heuristic is known to perform well for such problems. A new version of the latter heuristic, which utilizes the dominance relation, is proposed and shown to perform much better than the other two heuristics.