✦ LIBER ✦

Single machine due-date scheduling of jobs with decreasing start-time dependent processing times

✍ Scribed by T. C. E. Cheng; L. Y. Kang; C. T. Ng

Book ID: 111205817
Publisher: John Wiley and Sons
Year: 2005
Tongue: English
Weight: 139 KB
Volume: 12
Category: Article
ISSN: 0969-6016
DOI: 10.1111/j.1475-3995.2005.501_1.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single-machine scheduling with precedenc

Single-machine scheduling with precedence constraints and decreasing start-time dependent processing times

✍ Wen-Jun Gao; Xue Huang; Ji-Bo Wang 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 266 KB

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 scheduling problems with

Single-machine scheduling problems with start-time dependent processing time

✍ Wen-Hung Kuo; Dar-Li Yang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 204 KB

Single-machine group scheduling with lin

Single-machine group scheduling with linearly decreasing time-dependent setup times and job processing times

✍ Ji-Bo Wang; Linyan Sun 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 264 KB

Single machine scheduling with start tim

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

✍ P.S. Sundararaghavan; A.S. Kunnathur 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 554 KB

Due-date assignment and single machine s

Due-date assignment and single machine scheduling with compressible processing times

✍ T.C.E. Cheng; C. Oǧuz; X.D. Qi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 588 KB

In this paper we consider a due-date assignment and single machine scheduling problem in which the jobs have compressible processing times. Two models are defined according to the due-date assignment methods used. The first model applies the common (constant) due-date assignment method to assign the