Hybridizing discrete- and continuous-time models for batch sizing and scheduling problems [An article from: Computers and Operations Research] | ![Hybridizing discrete- and continuous-time models for batch sizing and scheduling problems [An article from: Computers and Operations Research]](http://ecx.images-amazon.com/images/I/41SS7GZHX6L._SL160_.jpg)
 enlarge | Authors: S. Wang, M. Guignard
Publisher: Elsevier
Category: Book
Buy New: $7.95
Format: Html
Media: Digital
Pages: 22
Publication Date: April 1, 2006
Availability: Available for download now
| |
| Editorial Reviews:
Product Description
This digital document is a journal article from Computers and Operations Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
This paper proposes a new hybrid technique called ''partial parameter uniformization'' (hereafter PPU). The technique simplifies problems by ignoring the different values that certain problem parameters can take, which may facilitate the solution of some hard combinatorial optimization problems. PPU is applied to complex batch sizing and scheduling problems. Some information can be obtained from a discrete-time model in which job durations have been made uniform. This information is then exploited by a more detailed continuous-time model to generate feasible solutions and further improve these solutions. Good, or optimal solutions to the Westenberger and Kallrath Benchmark problems have been obtained in this way, at relatively low computational cost, as have solutions to the newer problems of Blomer and Gunther.
|
|
|
