Solving a chemical batch scheduling problem by local search

Share/Save/Bookmark

Brucker, P. and Hurink, J.L. (2000) Solving a chemical batch scheduling problem by local search. Annals of Operations Research, 96 (1-4). pp. 17-38. ISSN 0254-5330

[img]PDF
Restricted to UT campus only
: Request a copy
150Kb
Abstract:In this paper the following chemical batch scheduling problem is considered: a set of orders has to be processed on a set of facilities. For each order a given amount of a product must be produced by means of chemical reactions before a given deadline. The production consists of a sequence of processes whereby each process has to be performed by one facility out of a given subset of facilities allowed for this process. The processing times depend on the choice of the facility and the processing is done in batch mode with given minimum and maximum sizes. The problem is to assign the processes to the facilities, splitting them into batches, and scheduling these batches in order to produce the demands within the given deadlines.
For the scheduling part of the problem we present an approach based on the following steps. First, a procedure to calculate the minimum number of batches needed to satisfy the demands is presented. Based on this, the given problem is modeled in two different ways: as a general shop scheduling problem with set-up times or as scheduling problem with positive time-lags. Finally, a two-phase tabu search method is presented which is based on the two different formulations of the problem. The method is tested on some real world data.
Item Type:Article
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/63580
Official URL:http://dx.doi.org/10.1023/A:1018959704264
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page