✦ LIBER ✦

Efficient heuristics to minimize total flow time with release dates

✍ Scribed by Chengbin Chu

Book ID: 107918238
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 587 KB
Volume: 12
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(92)90092-h

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 flow time with unequal release dates

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

A heuristic to minimize total flow time

A heuristic to minimize total flow time in permutation flow shop

✍ Dipak Laha; Subhash C. Sarin 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 131 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

Minimizing total completion time subject

Minimizing total completion time subject to release dates and sequence‐dependentprocessing times

✍ L. Bianco; P. Dell'Olmo; S. Giordani 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 207 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 HEURISTIC ALGORITHM TO MINIMIZE TOTAL

A HEURISTIC ALGORITHM TO MINIMIZE TOTAL WEIGHTED TARDINESS ON A SINGLE MACHINE WITH RELEASE DATES AND SEQUENCE-DEPENDENT SETUP TIMES

✍ Chang, Tzu-Yun; Chou, Fuh-Der; Lee, Ching-En 📂 Article 📅 2004 🏛 Chinese Electronic Periodical Services 🌐 Chinese ⚖ 257 KB