Minimizing the total completion time in a distributed two stage assembly system with setup times

Authors:
Fuli Xiong;Keyi Xing;Feng Wang;Hang Lei;Libin Han
Affiliations:
-;-;-;-;-
Venue:
Computers and Operations Research
Year:
2014

Citing 18
Cited 0

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem

Management Science
Genetic algorithms for flowshop scheduling problems

Computers and Industrial Engineering
Variable neighborhood search

Computers and Operations Research
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

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

Computers and Operations Research
Design and Analysis of Experiments

Design and Analysis of Experiments
A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date

Computers and Industrial Engineering
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
The two-stage assembly scheduling problem to minimize total completion time with setup times

Computers and Operations Research
A variable neighborhood search for job shop scheduling with set-up times to minimize makespan

Future Generation Computer Systems
Flexible job-shop scheduling with parallel variable neighborhood search algorithm

Expert Systems with Applications: An International Journal
The distributed permutation flowshop 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
An adaptive genetic algorithm with dominated genes for distributed scheduling problems

Expert Systems with Applications: An International Journal
A high performing metaheuristic for job shop scheduling with sequence-dependent setup times

Applied Soft Computing
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, a novel distributed two stage assembly flowshop scheduling problem (DTSAFSP) is addressed. The objective is to assign jobs to several factories and schedule the jobs in each factory with the minimum total completion time (TCT). In view of the NP-hardness of the DTSAFSP, we develop heuristics method to deal with the problem and propose three hybrid meta-heuristics (HVNS, HGA-RVNS, and HDDE-RVNS). The parameters of HGA-RVNS and HDDE-RVNS are tuned by using the Taguchi method and that of HVNS is done by using the single factor ANOVA method. Computational experiments have been conducted to compare the performances of the proposed algorithms. The analyses of computational results show that, for the instances with small numbers of jobs, HDDE-RVNS obtains better performances than HGA-RVNS and HVNS; whereas for the instances with large numbers of jobs, HGA-RVNS is the best one in all the proposed algorithms. Computational results indicate that the performances of the HDDE-RVNS and HGA-RVNS are not much affected by the number of machines at the first stage and factories. The experimental results also show that the RVNS-based local search steps in both HGA-RVNS and HDDE-RVNS are efficient and effective.