𝔖 Bobbio Scriptorium

✦ LIBER ✦

A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios

✍ Scribed by Sakib A. Mondal

Book ID: 107668811
Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 339 KB
Volume: 46
Category: Article
ISSN: 0030-3887
DOI: 10.1007/s12597-009-0026-x

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

A hybridization of simulated annealing a

A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness

✍ R. Tavakkoli-Moghaddam; M. Khalili; B. Naderi 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 637 KB