✦ LIBER ✦

Single-vehicle scheduling problems with release and service times on a line

✍ Scribed by Wei Yu; Zhaohui Liu

Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 110 KB
Volume: 57
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20393

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Better approximation ratios for the sing

Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks

✍ Yoshiyuki Karuno; Hiroshi Nagamochi; Toshihide Ibaraki 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

Modeling and solving a multimodal transp

Modeling and solving a multimodal transportation problem with flexible-time and scheduled services

✍ Luigi Moccia; Jean-François Cordeau; Gilbert Laporte; Stefan Ropke; Maria Pia Va 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 305 KB

This article studies a transportation problem in a multimodal network with shipment consolidation options. A freight forwarder can use a mix of flexible-time and scheduled transportation services. Time windows are a prominent aspect of the problem. For instance, they are used to model pickup and del

A note on the single-machine scheduling

A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness

✍ Suresh Chand; Hans Schneeberger 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

This paper analyzes the Smith-heuristic for the single-machine scheduling problem where the objective is to minimize the total weighted completion time subject to the constraint that the tardiness for any job does not exceed a prespecified maximum allowable tardiness. We identify several cases of th

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