Jobshop Scheduling in a Shipyard | Thomas Stidsen, Lars V. Kragelund, Oana Mateescu
| | Abstract | Jobshop scheduling is considered a standard problem to solve by means of a genetic algorithms and a number of articles have been written on this subject. In spite of this, only few applications of Genetic Algorithms (GA) have been published on real jobshop scheduling problems and even though some applications may not be published for busniess related reasons, more pratical applications seems necessary in order to convince engineering and planning people of the use of GA for jobshop scheduling.
A shipyard is a larg and complex organization, including many employees with many specialized functions, many different workshops differentiated over a large area and all dependent on each other in complex ways. Because ships are usually built in small series, the organization needs to be flexible in order to adapt to new needs and for the planning people the demands are huge. If it is possible to establish efficient tools for jobshop scheduling in such an organization for at least parts of the planning, it will be of significant pratical value. | | Type | Conference paper [With referee] | | Conference | European Conference on Artificial Intelligence, Budapest | | Year | 1996 | | BibTeX data | [bibtex] | | IMM Group(s) | Operations Research |
|