✦ LIBER ✦

Integrated machine scheduling and vehicle routing with time windows

✍ Scribed by Ullrich, Christian A.

Book ID: 118747180
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 642 KB
Volume: 227
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2012.11.049

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An exact solution approach for vehicle r

An exact solution approach for vehicle routing and scheduling problems with soft time windows

✍ A.G. Qureshi; E. Taniguchi; T. Yamada 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 768 KB

Vehicles scheduling with sliding time wi

Vehicles scheduling with sliding time windows

✍ Jacques A. Ferland; Luc Fortin 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 906 KB

The robust vehicle routing problem with

The robust vehicle routing problem with time windows

✍ Agra, Agostinho; Christiansen, Marielle; Figueiredo, Rosa; Hvattum, Lars Magnus; 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 303 KB

Algorithms for the Vehicle Routing and S

Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints

✍ Solomon, Marius M. 📂 Article 📅 1987 🏛 INFORMS 🌐 English ⚖ 669 KB

A parallel route building algorithm for

A parallel route building algorithm for the vehicle routing and scheduling problem with time windows

✍ Jean-Yves Potvin; Jean-Marc Rousseau 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 675 KB

Single-vehicle scheduling with time wind

Single-vehicle scheduling with time window constraints

✍ Gilbert H. Young; Chi-Lok Chan 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 164 KB

In the single-vehicle scheduling problem with time window constraints, a vehicle has to visit a set of sites on a graph, and each site must be visited after its ready time but no later than its deadline. The goal is to minimize the total time taken to visit all sites. We prove the conjecture propose