Mixed binary integer programming formulations for the reentrant job shop scheduling problem [An article from: Computers and Operations Research]

This digital document is a journal article from Computers and Operations Research, published by Elsevier in 2005. 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 describes the development of mixed binary integer programming (BIP) formulations for the reentrant job shop scheduling problem. Based on an earlier classical job shop model developed by Manne and improved by Liao and You, this paper presents two extended BIP optimization formulations for the problem under consideration. In order to improve the solution speed of the BIP formulations, two layer division procedures are developed and incorporated in the corresponding models. Results of computational experiments, in which an average performance of these formulations is investigated, are also reported.