Abstract
The problem is formulated in the Mixed Integer Bilinear Program (MIBLP) form (see Chapter 13) as in the previous chapter. A difference is that here we optimize the randomization procedure of Simulated Annealing type using the MIBLP penalty function as a part of heuristics. Another difference is that we describe the complete batch scheduling problem, not just illustrative example as in Section 14.3 of the last chapter.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Mockus, J., Eddy, W., Mockus, A., Mockus, L., Reklaitis, G. (1997). Batch Process Scheduling Using Simulated Annealing. In: Bayesian Heuristic Approach to Discrete and Global Optimization. Nonconvex Optimization and Its Applications, vol 17. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2627-5_15
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2627-5_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4767-3
Online ISBN: 978-1-4757-2627-5
eBook Packages: Springer Book Archive