๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Solving the job-shop scheduling problem optimally by dynamic programming

โœ Scribed by Gromicho, Joaquim A.S.; van Hoorn, Jelke J.; Saldanha-da-Gama, Francisco; Timmer, Gerrit T.

Book ID
119221928
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
411 KB
Volume
39
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient memetic algorithm for solvi
An efficient memetic algorithm for solving the job shop scheduling problem
โœ Liang Gao; Guohui Zhang; Liping Zhang; Xinyu Li ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 741 KB

## a b s t r a c t The job shop scheduling problem (JSP) is well known as one of the most complicated combinatorial optimization problems, and it is a NP-hard problem. Memetic algorithm (MA) which combines the global search and local search is a hybrid evolutionary algorithm. In this paper, an eff

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