✦ LIBER ✦

Upgrading arcs to minimize the maximum travel time in a network

✍ Scribed by Ann Melissa Campbell; Timothy J. Lowe; Li Zhang

Publisher: John Wiley and Sons
Year: 2006
Tongue: English
Weight: 188 KB
Volume: 47
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20097

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An investment policy to reduce the trave

An investment policy to reduce the travel time in a transportation network

✍ T.M. Ridley 📂 Article 📅 1968 🏛 Elsevier Science ⚖ 957 KB

Investing in arcs in a network to maximi

Investing in arcs in a network to maximize the expected max flow

✍ Stein W. Wallace 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 808 KB

A network flow algorithm to minimize bea

A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy

✍ Ravindra K. Ahuja; Horst W. Hamacher 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views

Fast algorithms to minimize the makespan

Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times

✍ Jinliang Cheng; George Steiner; Paul Stephenson 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 186 KB 👁 2 views

We consider the two-machine ow-shop problem with release times where the objective is to minimize either the makespan or the maximum lateness. We present a uniÿed treatment of various sequenceinterchange operators and derive powerful new dominance orders, which are incorporated into branchand-bound

Restarts can help in the on-line minimiz

Restarts can help in the on-line minimization of the maximum delivery time on a single machine

✍ Marjan van den Akker; Han Hoogeveen; Nodari Vakhania 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 86 KB 👁 2 views

Positioning of automated guided vehicles

Positioning of automated guided vehicles in a loop layout to minimize the mean vehicle response time

✍ Kap Hwan Kim 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1005 KB