✦ LIBER ✦

A GRASP™ for a difficult single machine scheduling problem

✍ Scribed by Thomas A. Feo; Krishnamurthi Venkatraman; Jonathan F. Bard

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 976 KB
Volume: 18
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(91)90001-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A greedy heuristic for bicriterion singl

A greedy heuristic for bicriterion single machine scheduling problems

✍ Pei Chann (michael) Chang; Han Chau (garry) Lee 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 617 KB

A grasp for single machine scheduling wi

A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties

✍ Thomas A. Feo; Kishore Sarathy; John McGahan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 812 KB

A single-machine scheduling problem with

A single-machine scheduling problem with random processing times

✍ S. Chakravarthy 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 282 KB

Lower bounds for single-machine scheduli

Lower bounds for single-machine scheduling problems

✍ Reza H. Ahmadi; Uttarayan Bagchi 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 588 KB

A dynamic programming method for single

A dynamic programming method for single machine scheduling

✍ Toshihide Ibaraki; Yuichi Nakamura 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 642 KB

Some single-machine scheduling problems

Some single-machine scheduling problems with a truncation learning effect

✍ Chin-Chia Wu; Yunqiang Yin; Shuenn-Ren Cheng 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 219 KB

Scheduling with learning effects has received growing attention nowadays. A well-known learning model is called ''sum-of processing-times-based learning'' in which the actual processing time of a job is a nonincreasing function of the jobs already processed. However, the actual processing time of a