✦ LIBER ✦

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

✍ Scribed by Chen, Yong; Zhang, An; Tan, Zhiyi

Book ID: 121687469
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 748 KB
Volume: 251
Category: Article
ISSN: 0020-0255
DOI: 10.1016/j.ins.2013.07.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved branch and bound algorithm f

An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time

✍ Yunpeng Pan 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 173 KB

Scheduling of a single machine to minimi

Scheduling of a single machine to minimize total weighted completion time subject to release dates

✍ Lucio Bianco; Salvatore Ricciardelli 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 764 KB

## Abstract In this paper the __n__/1/__r__~j~ Σ~j~ __w__~__j__~ __C__~__j__~ problem under the assumptions of nonpreemptive sequencing and sequence independent processing times is investigated. After pointing out the fundamental properties, some dominance sufficient conditions among sequences are

The single machine serial batch scheduli

The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost

✍ Shabtay, Dvir 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 468 KB

Single machine bicriteria scheduling wit

Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost

✍ Cheng He, Hao Lin, Xiumei Wang 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 151 KB

On the single machine serial batching sc

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

✍ C.T. Ng; T.C.E. Cheng; J.J. Yuan; Z.H. Liu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 175 KB

Two simple constant ratio approximation

Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval

✍ Hans Kellerer; Mikhail A. Kubzin; Vitaly A. Strusevich 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 205 KB