A comparative study of annealing methods for batch scheduling problems

Datta, B. ; Jayaraman, V. K. ; Kulkarni, B. D. (2001) A comparative study of annealing methods for batch scheduling problems Chemical Engineering Research and Design, 79 (6). pp. 673-683. ISSN 0263-8762

Full text not available from this repository.

Official URL: http://linkinghub.elsevier.com/retrieve/pii/S02638...

Related URL: http://dx.doi.org/10.1205/026387601316971343

Abstract

Batch Scheduling is an important problem, relevant to a large sector of the processing industries. Methods like Simulated Annealing have been traditionally used in dealing with scheduling problems that are combinatorially complex. In this paper the performance of four different annealing strategies, Simulated Annealing (SA), Threshold Acceptance (TA) and Multicanonical Jump Walk Annealing (MJWA) with and without window factor scheduling have been compared for small and large size problems. Criteria such as robustness of the method and mean deviation from the optimal solution reveal that the MJWA with window factor scheduling is far superior to SA, TA or MJWA without window factor scheduling.

Item Type:Article
Source:Copyright of this article belongs to Institution of Chemical Engineers.
Keywords:Batch; Computation; Optimization; Product Processing; Multicanonical Ensembles; Combinatorial Minimization
ID Code:17536
Deposited On:16 Nov 2010 09:37
Last Modified:06 Jun 2011 09:17

Repository Staff Only: item control page