𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Jason Chao-Hsien Pan; Jen-Shiang Chen

Book ID
108105597
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
290 KB
Volume
32
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Mixed binary integer programming formula
Mixed binary integer programming formulations for the reentrant job shop scheduling problem
✍ Jason Chao-Hsien Pan; Jen-Shiang Chen πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 290 KB

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