Autor: |
François B. Vernadat, Nikolay Guschinsky, Genrikh Levin, Alexandre Dolgui, B. Finel |
Rok vydání: |
2003 |
Předmět: |
|
Zdroj: |
IFAC Proceedings Volumes. 36:261-266 |
ISSN: |
1474-6670 |
DOI: |
10.1016/s1474-6670(17)37767-4 |
Popis: |
In this paper some algorithms which can be used to minimise the line cost of lines where operations can be executed simultaneously (for example by a spindle head) on workstations in series are presented: the operations can be grouped in blocks of parallel operations. The duration of the longest operation of a block is its processing time; the workstation time is the sum of processing times of its blocks. Two types of methods are proposed: the first one is based on a MIP model, and the second one on random search heuristic. Some comparisons are given |
Databáze: |
OpenAIRE |
Externí odkaz: |
|