Meta-heuristics for scheduling flexible job shop problems with constraints

• المؤلف الرئيسي: Gao, Kaizhou
• مؤلفون آخرون: Chong Chin Soon
• التنسيق: Theses and Dissertations
• اللغة: English
• منشور في: 2015
• الموضوعات: DRNTU::Engineering::Electrical and electronic engineering
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/65649
• المؤسسة: Nanyang Technological University

Flexible job-shop scheduling problem (FJSSP) is an extension of the classical job shop scheduling problem (JSSP) with practical applications. FJSSP has been proven as an NP-hard problem. Many researchers have focused on FJSSP in recent years. FJSSP includes two sub-problems: 1. machine assignment th...