✦ LIBER ✦

Optimization method with large leap steps for job shop scheduling

✍ Scribed by Yong Ming Wang; Hong Li Yin; Jiang Wang; Kai Da Qin; Yu Chen

Publisher: Springer
Year: 2008
Tongue: English
Weight: 212 KB
Volume: 43
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-008-1781-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Research on job-shop scheduling optimiza

Research on job-shop scheduling optimization method with limited resources

✍ Liu Yongxian; Liu Xiaotian; Zhao Jinfu 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 240 KB

Hybridizing tabu search with ant colony

Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems

✍ V. P. Eswaramurthy; A. Tamilarasi 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 250 KB

An effective heuristic method for genera

An effective heuristic method for generalized job shop scheduling with due dates

✍ Taeyong Yang; Zesheng He; Kyu Kab Cho 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 975 KB

Improved solutions for job shop scheduli

Improved solutions for job shop scheduling problems through genetic algorithm with a different method of schedule deduction

✍ K.S. Amirthagadeswaran; V.P. Arunachalam 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 512 KB

Genetic algorithms for the job-shop sche

Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: Heuristic mixing method machines and precedence

✍ Fatima Ghedjati 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 360 KB

In this paper, we are interested in job-shop scheduling problems with several unrelated parallel machines and precedence constraints between the operations of the jobs (with either linear or non-linear process routings). The objective is to minimize the maximum completion time (Cmax). We propose an