✦ LIBER ✦

Robust scheduling on a single machine to minimize total flow time

✍ Scribed by Chung-Cheng Lu; Shih-Wei Lin; Kuo-Ching Ying

Book ID: 113553776
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 250 KB
Volume: 39
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2011.10.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single machine scheduling to minimize to

Single machine scheduling to minimize total weighted tardiness

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

Single Machine Scheduling to Minimize To

Single Machine Scheduling to Minimize Total Weighted Late Work

✍ Hariri, A. M. A.; Potts, C. N.; Van Wassenhove, L. N. 📂 Article 📅 1995 🏛 Operations Research Society of America 🌐 English ⚖ 981 KB

On-line scheduling on a single machine:

On-line scheduling on a single machine: minimizing the total completion time

✍ Amos Fiat; Gerhard J. Woeginger 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 65 KB

Single machine batch scheduling to minim

Single machine batch scheduling to minimize total completion time and resource consumption costs

✍ Dvir Shabtay; George Steiner 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 275 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

Minimizing total flow time in the single

Minimizing total flow time in the single-machine scheduling problem with periodic maintenance

✍ Chen, W J 📂 Article 📅 2006 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 139 KB