A PTAS for a resource scheduling problem with arbitrary number of parallel machines (NDA@SZTAKI, Nemzeti Digitális Adattár, National Digital Data Archive)

Tartalom:	http://real.mtak.hu/39080/
Archívum:	MTA Könyvtár
Gyûjtemény:	Status = In Press Type = Article
Cím:	A PTAS for a resource scheduling problem with arbitrary number of parallel machines
Létrehozó:	GyÃ¶rgyi, PÃ©ter
Kiadó:	Elsevier
Dátum:	2016
Téma:	QA75 Electronic computers. Computer science / szÃ¡mÃtÃ¡stechnika, szÃ¡mÃtÃ³gÃ©ptudomÃ¡ny
Tartalmi leírás:	In this paper we study a parallel machine scheduling problem with non-renewable resource constraints. That is, besides the jobs and machines, there is a common non-renewable resource consumed by the jobs, which has an initial stock and some additional supplies over time. Unlike in most previous results, the number of machines is part of the input. We describe a polynomial time approximation scheme for minimizing the makespan.
Nyelv:	magyar
Típus:	Article NonPeerReviewed info:eu-repo/semantics/article
Formátum:	text
Azonosító:	http://real.mtak.hu/39080/7/parallel_ptas2_rev3.pdf GyÃ¶rgyi, PÃ©ter (2016) A PTAS for a resource scheduling problem with arbitrary number of parallel machines. Operations Research Letters. pp. 1-7. ISSN 0167-6377 (In Press)
Kapcsolat:	http://real.mtak.hu/39080/ https://doi.org/10.1016/j.orl.2017.09.007