✦ LIBER ✦

A branch-and-bound algorithm to minimize total flow time with unequal release dates

✍ Scribed by Chengbin Chu

Publisher: John Wiley and Sons
Year: 1992
Tongue: English
Weight: 901 KB
Volume: 39
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(199210)39:6<859::aid-nav3220390610>3.0.co;2-w

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-bound algorithm to minimize

A branch-and-bound algorithm to minimize total tardiness with different release dates

✍ Chengbin Chu 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 945 KB

An algorithm for single machine sequenci

An algorithm for single machine sequencing with release dates to minimize total weighted completion time

✍ A.M.A. Hariri; C.N. Potts 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 721 KB

Scheduling of a single machine to minimi

Scheduling of a single machine to minimize total weighted completion time subject to release dates

✍ Lucio Bianco; Salvatore Ricciardelli 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 764 KB

## Abstract In this paper the __n__/1/__r__~j~ Σ~j~ __w__~__j__~ __C__~__j__~ problem under the assumptions of nonpreemptive sequencing and sequence independent processing times is investigated. After pointing out the fundamental properties, some dominance sufficient conditions among sequences are

A branch and bound algorithm to minimize

A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop

✍ A.M.A. Hariri; C.N. Potts 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 66 KB