✦ LIBER ✦

Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem

✍ Scribed by Averbakh, Igor; Baysan, Mehmet

Book ID: 121353277
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 364 KB
Volume: 41
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2013.10.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Application of an effective modified gra

Application of an effective modified gravitational search algorithm for the coordinated scheduling problem in a two-stage supply chain

✍ Jun Pei,Xinbao Liu,Panos M. Pardalos… 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 679 KB

2-Approximation algorithms for the multi

2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times

✍ Yoshiyuki Karuno; Hiroshi Nagamochi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 180 KB

In this paper, given a path G with n vertices v1; v2; : : : ; vn and m identical vehicles, we consider a scheduling problem of the vehicles on the path. Each vertex vj in G has exactly one job j. Any of the n jobs must be served by some vehicle. Each job j has a release time rj and a handling time h

Approximation algorithms for minimizing

Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains

✍ George Steiner; Rui Zhang 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 359 KB