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

Authors:
E. Torabzadeh;M. Zandieh
Affiliations:
Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran;Department of Industrial Management, Management and Accounting Faculty, Shahid Beheshti University, G.C., Tehran, Iran
Venue:
Advances in Engineering Software
Year:
2010

Citing 7
Cited 1

Simulated annealing: theory and applications

Simulated annealing: theory and applications
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
Spatial Clustering Method Based on Cloud Model

FSKD '07 Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02
The two-stage assembly scheduling problem to minimize total completion time with setup times

Computers and Operations Research
Cloud theory-based simulated annealing algorithm and application

Engineering Applications of Artificial Intelligence
A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application

Computers and Operations Research

Incorporating utility and cloud theories for owner evaluation in tendering

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the two-stage assembly flowshop problems where we have m machines in the first stage and an assembly machine in the second stage. We aim to minimize a weighted sum of makespan and mean completion time as the objective for n available jobs. The problem is NP-hard, therefore we proposed the cloud theory-based simulated annealing algorithm (CSA) to solve it. In previous literature Allahverdi and Al-Anzi [5] showed that simulated annealing (SA) is an appropriate heuristic to solve this problem, so we have compared CSA and SA in this study. The computational results reveal that CSA performs better. In addition computational time has been decreased for the CSA algorithm towards the SA.