Meta-heuristics for scheduling flexible job shop problems with constraints
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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2015
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/65649 |