TY - JOUR
T1 - Minimising Total Flow Time in Permutation Flow Shop Scheduling using a Simulated Annealing-based Approach
AU - Laha, Dipak
AU - Chakraborty, Uday Kumar
N1 - This paper presents an efficient simulated annealing algorithm for minimising the total flow time in n-job, m-machine permutation flow shop scheduling problems. Empirical results demonstrate that the proposed approach is competitive with the best three methods in the flow shop literature. Statistical tests of significance are used to validate the improvement in solution quality.
PY - 2010/1/1
Y1 - 2010/1/1
N2 - This paper presents an efficient simulated annealing algorithm for minimising the total flow time in n-job, m-machine permutation flow shop scheduling problems. Empirical results demonstrate that the proposed approach is competitive with the best three methods in the flow shop literature. Statistical tests of significance are used to validate the improvement in solution quality.
AB - This paper presents an efficient simulated annealing algorithm for minimising the total flow time in n-job, m-machine permutation flow shop scheduling problems. Empirical results demonstrate that the proposed approach is competitive with the best three methods in the flow shop literature. Statistical tests of significance are used to validate the improvement in solution quality.
UR - http://www.inderscienceonline.com/doi/full/10.1504/IJAAC.2010.035525
U2 - 10.1504/IJAAC.2010.035525
DO - 10.1504/IJAAC.2010.035525
M3 - Article
VL - 4
JO - International Journal of Automation and Control
JF - International Journal of Automation and Control
ER -