Luis J. Zeballos, Juan M. Novas, Gabriela P. Henning
Computers & Chemical Engineering, Volume 35, Issue 12, December 2011
Abstract
The short-term scheduling of multiproduct multistage batch plants is tackled in this paper by means of a constraint programming (CP) methodology. This approach, consisting of both a model and a search strategy, easily handles different features found in industrial environments: finite unit ready times, dissimilar parallel equipment at each stage, sequence-dependent changeovers, topology constraints, forbidden job-equipment assignments, order release times, as well as renewable resources limitations. It can also address various interstage storage and operational policies: UIS, NIS/ZW, NIS/UW, and mixed ones. Besides, it introduces two simple and efficient search methodologies based on domain knowledge, whose great impact on the computational performance is shown. The approach was extensively tested by means of several examples having various difficulty degrees. It rendered good computational results for a variety of interstage storage policies and objective functions. Moreover, this work shows that the default depth-first search strategy does not perform well for scheduling problems.

Go to Journal
Advances in Engineering Advances in Engineering features breaking research judged by Advances in Engineering advisory team to be of key importance in the Engineering field. Papers are selected from over 10,000 published each week from most peer reviewed journals.