In this paper a Simulated Annealing algorithm is proposed and applied to the n-job andm-machme discrete-continuous scheduling problem with the objective to minimize the makespan.This problem can be divided into two interrelated subproblems (i) constructing a feasible sequenceof jobs on machines and (ii) allocating the continuos resource among jobs already sequenced.The application of the Simulated Annealing algorithm operating on a space of feasible sequences ispresented. By computational experiment on randomly generated test problems, the proposedalgorithm is compared with two other heuristics, namely Multi-start Iterative Improvementalgorithm and Random Sampling Technique.
Jul 29, 2014
May 21, 2014
|10.12921_cmst.1996.02.01.73-85_Jozefowska||Jul 29, 2014|
Józefowska Joanna Mika Marek, Różycki Rafał, Waligóra Grzegorz, Węglarz Jan