✦ LIBER ✦

Single facility scheduling with nonlinear processing times

✍ Scribed by Jatinder N.D. Gupta; Sushil K. Gupta

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 373 KB
Volume: 14
Category: Article
ISSN: 0360-8352
DOI: 10.1016/0360-8352(88)90041-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Single-machine scheduling with deteriora

Single-machine scheduling with deteriorating functions for job processing times

✍ T.C.E. Cheng; Wen-Chiung Lee; Chin-Chia Wu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 194 KB

Single machine scheduling with controlla

Single machine scheduling with controllable processing times: a parametric study

✍ In-Soo Lee 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Scheduling with step-improving processin

Scheduling with step-improving processing times

✍ T.C. Edwin Cheng; Yong He; Han Hoogeveen; Min Ji; Gerhard J. Woeginger 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 135 KB

Single machine batch scheduling with dea

Single machine batch scheduling with deadlines and resource dependent processing times

✍ T.C. Edwin Cheng; Mikhail Y. Kovalyov 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 519 KB

Single-machine scheduling with learning

Single-machine scheduling with learning effect and resource-dependent processing times

✍ Dan Wang; Ming-Zheng Wang; Ji-Bo Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 206 KB

We consider resource allocation scheduling with learning effect in which the processing time of a job is a function of its position in a sequence and its resource allocation. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. We concentrate on two g