✦ LIBER ✦

A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment

✍ Scribed by Kripa Shanker; Bimal K. Modi

Book ID: 108445385
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 125 KB
Volume: 113
Category: Article
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(97)00433-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-bound algorithm for the res

A branch-and-bound algorithm for the resource-constrained project scheduling problem

✍ U. Dorndorf; E. Pesch; T. Phan-Huy 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 184 KB

A branch and bound algorithm for the res

A branch and bound algorithm for the resource-constrained project scheduling problem

✍ Peter Brucker; Sigrid Knust; Arno Schoo; Olaf Thiele 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 257 KB

A branch and bound algorithm is presented for the resource-constrained project scheduling problem (RCPSP). Given are n activities which have to be processed without preemptions. During the processing period of an activity constant amounts of renewable resources are needed where the available capacit

Mathematical model and genetic optimizat

Mathematical model and genetic optimization for the job shop scheduling problem in a mixed- and multi-product assembly environment: A case study based on the apparel industry

✍ Z.X. Guo; W.K. Wong; S.Y.S. Leung; J.T. Fan; S.F. Chan 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 451 KB