✦ LIBER ✦

Improved algorithms for two single machine scheduling problems

✍ Scribed by Yong He; Weiya Zhong; Huikun Gu

Book ID: 108281203
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 225 KB
Volume: 363
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.04.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hybrid electromagnetism-like algorithm

A hybrid electromagnetism-like algorithm for single machine scheduling problem

✍ Pei-Chann Chang; Shih-Hsin Chen; Chin-Yuan Fan 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 185 KB

Semi-Online Algorithms for Parallel Mach

Semi-Online Algorithms for Parallel Machine Scheduling Problems

✍ G. Dósa; Y. He 📂 Article 📅 2004 🏛 Springer Vienna 🌐 English ⚖ 288 KB

Tabu Search Algorithms for Cyclic Machin

Tabu Search Algorithms for Cyclic Machine Scheduling Problems

✍ Peter Brucker; Thomas Kampmeyer 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 737 KB

Single machine scheduling problems with

✍ Ji-Bo Wang; Li-Yan Wang; Dan Wang; Xiao-Yuan Wang; Wen-Jun Gao; Na Yin 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 286 KB

Lower bounds for single-machine scheduli

Lower bounds for single-machine scheduling problems

✍ Reza H. Ahmadi; Uttarayan Bagchi 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 588 KB

Parallel machine scheduling problems usi

Parallel machine scheduling problems using memetic algorithms

✍ Runwei Cheng; Mitsuo Gen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 309 KB

In this paper, we investigate how to apply the hybrid genetic algorithms (the memeti¢ algorithms) to solve the parallel machine scheduling problem. There are two essential issues to be dealt with for all kinds of parallel machine scheduling problems: job partition among machines and job sequence wit