✦ LIBER ✦

Non-approximability of precedence-constrained sequencing to minimize setups

✍ Scribed by Craig A. Tovey

Book ID: 108110479
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 249 KB
Volume: 134
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2003.08.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fully combinatorial 2-approximation al

A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time

✍ N.N. Pisaruk 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 217 KB

We study the problem of scheduling a single machine with the precedence relation on the set of jobs to minimize average weighted completion time. The problem is strongly NP-hard. The ÿrst combinatorial 2-approximation algorithm for this scheduling problem was developed by the author in 1992 (in fact

Heuristics for an assembly flow-shop wit

Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs

✍ Navaei, Javad; Fatemi Ghomi, Seyyed Mohammad Taghi; Jolai, Fariborz; Mozdgir, As 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 891 KB

Complexity and approximation of single m

Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time

✍ Chen, Yong; Zhang, An; Tan, Zhiyi 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 748 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