𝔖 Bobbio Scriptorium

✦ LIBER ✦

A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility

✍ Scribed by Bezalel Gavish and Robert E. Johnson

Book ID: 123687420
Publisher: INFORMS
Year: 1990
Tongue: English
Weight: 518 KB
Volume: 38
Category: Article
ISSN: 0030-364X
DOI: 10.2307/171299

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Erratum to “Fully polynomial time approx

Erratum to “Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval” [Comput. Ind. Eng. 56 (2009) 1708–1712]

✍ I. Kacem 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 114 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 2223 || A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling

✍ Eades, Peter; Takaoka, Tadao 📂 Article 📅 2001 🏛 Springer Berlin Heidelberg ⚖ 179 KB