Complexity and approximability of scheduling resumable proportionally deteriorating jobs

Complexity and approximability of scheduling resumable proportionally deteriorating jobs Full article

Journal

European Journal of Operational Research
ISSN: 0377-2217

Output data

Year: 2010, Volume: 200, Number: 1, Pages: 305-308 Pages count : 4 DOI: 10.1016/j.ejor.2008.12.014

Tags

Complexity theory; Deteriorating jobs; Fully polynomial-time approximation scheme; Scheduling

Authors

Gawiejnowicz Stanisław ¹ , Kononov Alexander ²

Affiliations

1	Adam Mickiewicz University, Faculty of Mathematics and Computer Science, Umultowska 87, 61-614 Poznan´, Poland
2	Sobolev Institute of Mathematics, Prospekt Akademika Koptyuga no. 4,630090 Novosibirsk, Russia

Gawiejnowicz S. , Kononov A.
Complexity and approximability of scheduling resumable proportionally deteriorating jobs
European Journal of Operational Research. 2010. V.200. N1. P.305-308. DOI: 10.1016/j.ejor.2008.12.014 WOS Scopus OpenAlex

Submitted:	Mar 22, 2008
Accepted:	Dec 9, 2008
Published online:	Dec 24, 2008

Web of science:	WOS:000270347700031
Scopus:	2-s2.0-69249233599
OpenAlex:	W2058023296

DB	Citing
Scopus	56
OpenAlex	57
Web of science	53