✦ LIBER ✦

Single machine scheduling with start time dependent processing times: Some solvable cases

✍ Scribed by P.S. Sundararaghavan; A.S. Kunnathur

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 554 KB
Volume: 78
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)90048-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on single-machine scheduling with

A note on single-machine scheduling with decreasing time-dependent job processing times

✍ Ji-Bo Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 175 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

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 subject to dea

Single machine scheduling subject to deadlines and resource dependent processing times

✍ Adam Janiak; Mikhail Y. Kovalyov 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 562 KB

Hybrid flowshop scheduling with machine

Hybrid flowshop scheduling with machine and resource-dependent processing times

✍ J. Behnamian; S.M.T. Fatemi Ghomi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 744 KB