In this paper we study the general problem of sequencing multiple jobs, where each job consists of multiple ordered tasks and tasks execution requires simultaneous usage of several resources. In particular, the case of an automatic assembly cell is examined. NP-completeness results are given. A heuristic is designed and evaluated.
Minimum Makespan Task Sequencing with Multiple Sared Resoures / Caramia, M; Dell'Olmo, Paolo; Onori, R.. - In: ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING. - ISSN 0736-5845. - STAMPA. - 20:(2004). [10.1016/j.rcim.2003.10.003]
Minimum Makespan Task Sequencing with Multiple Sared Resoures
DELL'OLMO, Paolo;
2004
Abstract
In this paper we study the general problem of sequencing multiple jobs, where each job consists of multiple ordered tasks and tasks execution requires simultaneous usage of several resources. In particular, the case of an automatic assembly cell is examined. NP-completeness results are given. A heuristic is designed and evaluated.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
