Sciact
  • EN
  • RU

NP-hard cases in scheduling deteriorating jobs on dedicated machines Full article

Journal Journal of the Operational Research Society
ISSN: 0160-5682 , E-ISSN: 1476-9360
Output data Year: 2001, Volume: 52, Number: 6, Pages: 708-717 Pages count : 10 DOI: 10.1057/palgrave.jors.2601117
Tags Deteriorating jobs; Flow shop; Makespan; NP-hardness; Open shop
Authors Kononov A 1 , Gawiejnowicz S 2
Affiliations
1 Sobolev Institute of Mathematics
2 Adam Mickiewicz University
Cite: Kononov A. , Gawiejnowicz S.
NP-hard cases in scheduling deteriorating jobs on dedicated machines
Journal of the Operational Research Society. 2001. V.52. N6. P.708-717. DOI: 10.1057/palgrave.jors.2601117 WOS Scopus OpenAlex
Identifiers:
Web of science: WOS:000169550000012
Scopus: 2-s2.0-0035365406
OpenAlex: W1972888404
Citing:
DB Citing
Scopus 75
OpenAlex 80
Web of science 69
Altmetrics: