A taxonomy for the flexible job shop scheduling problem
This chapter aims at developing a taxonomic framework to classify the studies on the flexible job shop scheduling problem (FJSP). The FJSP is a generalization of the classical job shop scheduling problem (JSP), which is one of the oldest NP-hard problems. Although various solution methodologies have...
Main Author: | |
---|---|
Other Authors: | , |
Format: | conferencePaper |
Language: | eng |
Published: |
2015
|
Subjects: | |
Online Access: | http://hdl.handle.net/1822/38741 |
Country: | Portugal |
Oai: | oai:repositorium.sdum.uminho.pt:1822/38741 |