Výsledky vyhledávání - "Batch scheduling Makespan Computational complexity FPTAS"
-
1
Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
ISSN: 0377-2217, 1872-6860Vydáno: Amsterdam Elsevier B.V 01.04.2010Vydáno v European journal of operational research (01.04.2010)“…We consider a scheduling problem in which n jobs are to be processed on a single machine. The jobs are processed in batches and the processing time of each job…”
Získat plný text
Journal Article