✦ LIBER ✦

Minimization of the number of layers for single row routing with fixed street capacity

✍ Scribed by Gonzalez, T.F.; Kurki-Gowdara, S.

Book ID: 119777863
Publisher: IEEE
Year: 1988
Tongue: English
Weight: 610 KB
Volume: 7
Category: Article
ISSN: 0278-0070
DOI: 10.1109/43.3175

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The minimum track number of the narrower

The minimum track number of the narrower channel in the signal-row single-layer routing

✍ Yoshifumi Manabe; Ken'Ichi Hagihara; Nobuki Tokura 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 666 KB

Branch and Bound Algorithms for Single M

Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs

✍ H. A. J. Crauwels; C. N. Potts; D. Van Oudheusden; L. N. Van Wassenhove 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 395 KB

Branch and Bound Algorithms for Single M

Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs

✍ H. A. J. Crauwels; C. N. Potts; D. Van Oudheusden; L. N. Van Wassenhove 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 395 KB

Polynomial time algorithms for minimizin

Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times

✍ Philippe Baptiste 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 102 KB 👁 2 views

We study the problem of minimizing the weighted number of late jobs to be scheduled on a single machine when processing times are equal. In this paper, we show that this problem, as well as its preemptive variant, are strongly polynomial. When preemption is not allowed ( 1"p H "p, r H " w H ; H ), t

Polynomial-time approximation scheme for

Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

✍ T.C. Edwin Cheng; Qingqin Nong; Chi To Ng 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB 👁 1 views

[Lecture Notes in Computer Science] Para

[Lecture Notes in Computer Science] Parallel Processing and Applied Mathematics Volume 7203 || A Parallel Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows

✍ Wyrzykowski, Roman; Dongarra, Jack; Karczewski, Konrad; Waśniewski, Jerzy 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 218 KB