Mixed binary integer programming formulations for the reentrant job shop scheduling problem

Mixed binary integer programming formulations for the reentrant job shop scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor2006789
Country: United Kingdom
Volume: 32
Issue: 5
Start Page Number: 1197
End Page Number: 1212
Publication Date: May 2005
Journal: Computers and Operations Research
Authors: ,
Keywords: programming: integer
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.