✦ LIBER ✦

Solving the Flexible Job Shop Problem on Multi-GPU

✍ Scribed by Bożejko, Wojciech; Hejducki, Zdziław; Uchroński, Mariusz; Wodecki, Mieczysław

Book ID: 122930951
Publisher: Elsevier
Year: 2012
Tongue: English
Weight: 241 KB
Volume: 9
Category: Article
ISSN: 1877-0509
DOI: 10.1016/j.procs.2012.04.227

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A heuristic algorithm for solving flexib

A heuristic algorithm for solving flexible job shop scheduling problem

✍ Ziaee, Mohsen 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 929 KB

Multi-Objective Flexible Job-Shop Schedu

Multi-Objective Flexible Job-Shop Scheduling Problem in Steel Tubes Production

✍ Lin Li; Jia-zhen Huo 📂 Article 📅 2009 🏛 Elsevier ⚖ 454 KB

An Algorithm for Solving the Job-Shop Pr

An Algorithm for Solving the Job-Shop Problem

✍ Carlier, J.; Pinson, E. 📂 Article 📅 1989 🏛 INFORMS 🌐 English ⚖ 493 KB

Solving Multiple-Objective Flexible Job

Solving Multiple-Objective Flexible Job Shop Problems by Evolution and Local Search

✍ Nhu Binh Ho, ; Joc Cing Tay, 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 281 KB

Modelling and solving a practical flexib

Modelling and solving a practical flexible job-shop scheduling problem with blocking constraints

✍ Mati, Yazid; Lahlou, Chams; Dauzère-Pérès, Stéphane 📂 Article 📅 2010 🏛 Taylor and Francis Group 🌐 English ⚖ 177 KB

Parallel hybrid metaheuristics for the f

Parallel hybrid metaheuristics for the flexible job shop problem

✍ Wojciech Bożejko; Mariusz Uchroński; Mieczysław Wodecki 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 1019 KB

A parallel approach to flexible job shop scheduling problem is presented in this paper. We propose two double-level parallel metaheuristic algorithms based on the new method of the neighborhood determination. Algorithms proposed here include two major modules: the machine selection module refer to e