Isomorphic scheduling problems | Sciact

Journal

Annals of Operations Research
ISSN: 0254-5330 , E-ISSN: 1572-9338

Output data

Year: 2012, Volume: 213, Number: 1, Pages: 131-145 Pages count : 15 DOI: 10.1007/s10479-012-1222-2

Tags

Approximation algorithms; Dedicated machines; Deteriorating jobs; Parallel machines; Polynomial algorithms; Scheduling; Single machine

Authors

Gawiejnowicz Stanisław ¹ , Kononov Alexander ^2,3

Affiliations

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

Gawiejnowicz S. , Kononov A.
Isomorphic scheduling problems
Annals of Operations Research. 2012. V.213. N1. P.131-145. DOI: 10.1007/s10479-012-1222-2 WOS Scopus OpenAlex

Published online:

Sep 19, 2012