Effective Design of the Simulated Annealing Algorithm for the Flowshop Problem with Minimum Makespan Criterion
In this paper we address the n-job, m-machine flowshop scheduling problem with minimum completion time (makespan) as the performance criterion. We describe an efficient design of the Simulated Annealing algorithm for solving approximately this NP-hard problem. The main difficulty in implementing th...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
National Institute of Telecommunications
2012-06-01
|
| Series: | Journal of Telecommunications and Information Technology |
| Subjects: | |
| Online Access: | https://jtit.pl/jtit/article/view/1269 |