✦ LIBER ✦

A reduced integer programming model for the ferry scheduling problem

✍ Scribed by Daniel Karapetyan, Abraham P. Punnen

Book ID: 120905739
Publisher: Springer-Verlag
Year: 2012
Tongue: English
Weight: 488 KB
Volume: 4
Category: Article
ISSN: 1866-749X
DOI: 10.1007/s12469-012-0058-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A bicriteria integer programming model f

A bicriteria integer programming model for the hierarchical workforce scheduling problem

✍ Pastor, Rafael; Corominas, Albert 📂 Article 📅 2010 🏛 Emerald Group Publishing Limited 🌐 English ⚖ 76 KB

An integer programming model for hierarc

An integer programming model for hierarchical workforce scheduling problem

✍ Serap Ulusam Seçkiner; Hadi Gökçen; Mustafa Kurt 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 127 KB

An integer programming model for the wee

An integer programming model for the weekly tour scheduling problem

✍ Tolga Çezik; Oktay Günlük; Hanan Luss 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

A study of integer programming formulati

A study of integer programming formulations for scheduling problems

✍ PAN, CHAO-HSIEN 📂 Article 📅 1997 🏛 Taylor and Francis Group 🌐 English ⚖ 434 KB

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

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