✦ LIBER ✦

A hybrid particle swarm optimization for parallel machine total tardiness scheduling

✍ Scribed by Qun Niu; Taijin Zhou; Ling Wang

Publisher: Springer
Year: 2009
Tongue: English
Weight: 314 KB
Volume: 49
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-009-2426-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Machine–part cell formation using a hybr

Machine–part cell formation using a hybrid particle swarm optimization

✍ Mona Anvari; Mohammad Saidi Mehrabad; Farnaz Barzinpour 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 204 KB

A hybrid particle swarm optimization app

A hybrid particle swarm optimization approach for the job-shop scheduling problem

✍ Wei-jun Xia; Zhi-ming Wu 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 444 KB

Parallel processor scheduling for minimi

Parallel processor scheduling for minimizing total weighted tardiness using ant colony optimization

✍ N. R. Srinivasa Raghavan; M. Venkataramana 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 228 KB

An effective hybrid particle swarm optim

An effective hybrid particle swarm optimization for no-wait flow shop scheduling

✍ Bo Liu; Ling Wang; Yi-Hui Jin 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 202 KB

A particle swarm optimization for multi-

A particle swarm optimization for multi-objective flowshop scheduling

✍ D. Y. Sha; Hsing Hung Lin 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 186 KB

Decomposition and hybrid simulated annea

Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem

✍ Christos Koulamas 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 2 views

A polynomial decomposition heuristic is developed for the parallel-machine tardiness problem (P//T V ) by extending the decomposition principle embedded in the single-machine tardiness problem (1//T V ) to a parallel-machine setting. The subproblems generated by the decomposition are solved by an ef