✦ LIBER ✦

Approximation algorithms for shop scheduling problems with minsum objective: A correction

✍ Scribed by Wenhua Li; Maurice Queyranne; Maxim Sviridenko; Jinjiang Yuan

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 165 KB
Volume: 9
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-006-8790-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithms for shop schedu

Approximation algorithms for shop scheduling problems with minsum objective

✍ Maurice Queyranne; Maxim Sviridenko 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 166 KB

We consider a general class of multiprocessor shop scheduling problems, preemptive or non-preemptive, with precedence constraints between operations, with job or operation release dates, and with a class of objective functions including weighted sums of job, operations and stage completion times. We

Approximation algorithms for scheduling

Approximation algorithms for scheduling problems with a modified total weighted tardiness objective

✍ Stavros G. Kolliopoulos; George Steiner 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 171 KB

A two-stage genetic algorithm for multi-

A two-stage genetic algorithm for multi-objective job shop scheduling problems

✍ Voratas Kachitvichyanukul; Siriwan Sitthitham 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 295 KB

Multi-objective optimization algorithms

Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects

✍ Yi Sun; Chaoyong Zhang; Liang Gao; Xiaojuan Wang 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 307 KB

Approximation algorithms for UET schedul

Approximation algorithms for UET scheduling problems with exact delays

✍ Alexander A. Ageev; Alexei E. Baburin 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 167 KB

A TSP-GA multi-objective algorithm for f

A TSP-GA multi-objective algorithm for flow-shop scheduling

✍ S.G. Ponnambalam; H. Jagannathan; M. Kataria; A. Gadicherla 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 235 KB