Parallel Simulated Annealing with Genetic Enhancement for flowshop problem with Csum

@article{Czapinski2010ParallelSA,
  title={Parallel Simulated Annealing with Genetic Enhancement for flowshop problem with Csum},
  author={Michal Czapinski},
  journal={Computers & Industrial Engineering},
  year={2010},
  volume={59},
  pages={778-785}
}
0360-8352/$ see front matter 2010 Elsevier Ltd. A doi:10.1016/j.cie.2010.08.003 q This manuscript was processed by Area Editor Ed ⇑ Tel.: +48 691661581. E-mail address: mczapinski@gmail.com In this paper, parallelisable Simulated Annealing with Genetic Enhancement (SAwGE) algorithm is presented and applied to Permutation Flowshop Scheduling Problem with total flowtime criterion. This problem is proved to be NP-complete in a strong sense for more than one machine. SAwGE is based on a Clustering… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 34 references

Minimizing the sum of completion times of n jobs over m machines in a flowshop – A branch and bound approach

S. P. Bansal
IIE Transactions, • 1977
View 4 Excerpts
Highly Influenced

Solving the flow shop problem by parallel programming

J. Parallel Distrib. Comput. • 2009
View 3 Excerpts
Highly Influenced

Optimal two- and three-stage production schedules with setup times included

S. M. Johnson
Naval Research Logistics Quarterly, • 1954
View 3 Excerpts
Highly Influenced

Cooperative metaheuristics for the permutation flowshop scheduling problem

European Journal of Operational Research • 2009
View 1 Excerpt

Efficient composite heuristics for total flowtime minimization in permutation flow

X. Li, Q. Wang, C. Wu
shops. Omega, • 2009
View 2 Excerpts

Efficient composite heuristics for total flowtime minimization in permutation flow shops

M. Nawaz, E. E. Enscore, I. Ham
Omega • 2009

Similar Papers

Loading similar papers…