Volltext verfügbar nach Anmeldung bzw. im Campus-Netz.
Flexible job-shop scheduling problems with ‘AND’/‘OR’ precedence constraints.
In: International Journal of Production Research, Jg. 50 (2012-04-01), Heft 7, S. 1979-2001
Online
academicJournal
Zugriff:
The purpose of this research is to solve flexible job-shop scheduling problems with ‘AND’/‘OR’ precedence constraints in the operations. We first formulate the problem as a Mixed-Integer Linear Program (MILP). The MILP can be used to compute optimal solutions for small-sized problems. We also developed a heuristic algorithm that can obtain a good solution for the problem regardless of its size. Moreover, we have developed a representation and schedule builder that always produces a legal and feasible solution for the problem, and developed genetic and tabu search algorithms based on the proposed schedule builder. The results of the computational experiments show that the developed meta-heuristics are very effective. [ABSTRACT FROM PUBLISHER]
Titel: |
Flexible job-shop scheduling problems with ‘AND’/‘OR’ precedence constraints.
|
---|---|
Autor/in / Beteiligte Person: | Lee, Sanghyup ; Moon, Ilkyeong ; Bae, Hyerim ; Kim, Jion |
Link: | |
Zeitschrift: | International Journal of Production Research, Jg. 50 (2012-04-01), Heft 7, S. 1979-2001 |
Veröffentlichung: | 2012 |
Medientyp: | academicJournal |
ISSN: | 0020-7543 (print) |
DOI: | 10.1080/00207543.2011.561375 |
Schlagwort: |
|
Sonstiges: |
|