✦ LIBER ✦

A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time

✍ Scribed by Ying Yu; Shi-jie Sun; Long-min He

Publisher: Chinese Electronic Periodical Services
Year: 2008
Tongue: English
Weight: 206 KB
Volume: 12
Category: Article
ISSN: 1007-6417
DOI: 10.1007/s11741-008-0304-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling problems on tardiness penalty

Scheduling problems on tardiness penalty and earliness award with simply linear processing time

✍ Ying Yu; Zhen Lu; Shi-jie Sun; Long-min He; Jing-di Hu 📂 Article 📅 2009 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 193 KB

The single-machine earliness-tardiness s

The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times

✍ Dvir Shabtay; George Steiner 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 375 KB

A dynamic programming algorithm for the

A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times

✍ Alberto Bosio; Giovanni Righini 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 461 KB

Scheduling jobs with random processing t

Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties

✍ X. Cai; F. S. Tu 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 942 KB

We examine the problem of scheduling n jobs with a common due date on a single machine. The processing time ofeach job is a random variable, which follows an arbitrary distribution with a known mean and a known variance. The machine is not reliable; it is subject to stochastic breakdowns. The objec

An approximation algorithm for a single-

An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times

✍ Eugeniusz Nowicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 455 KB

A note on “Beam search heuristics for th

A note on “Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time”

✍ F. Della Croce; E. Desmier; T. Garaix 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 171 KB

In a recent paper by Valente ''Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time" ', Computers & Industrial Engineering, 55, 663-675, 2008, several beam search approaches are compared on a large set of instances of the total weighted earlinesstard