Similar Search Results

Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one

Gafarov, Evgeny R.; Lazarev, Alexander A.; Werner, Frank - 2012

Persistent link: https://www.econbiz.de/10009987914

Single machine scheduling problems with financial resource constraints: Some complexity results and properties

Gafarov, Evgeny R.; Lazarev, Alexander A.; Werner, Frank - In: Mathematical Social Sciences 62 (2011) 1, pp. 7-13

We consider single machine scheduling problems with a non-renewable resource. These types of problems have not been intensively investigated in the literature so far. For several problems of these types with standard objective functions (namely the minimization of makespan, total tardiness,...

Persistent link: https://www.econbiz.de/10009194906

A note on the paper ‘Single machine scheduling problems with financial resource constraints: Some complexity results and properties’ by E.R. Gafarov et al.

Gafarov, Evgeny R.; Lazarev, Alexander A.; Werner, Frank - In: Mathematical Social Sciences 65 (2013) 3, pp. 232-232

This note emends an incorrectness in the NP-hardness proof of problem 1|NR,dj=d,gj=g|∑Tj given in a paper by Gafarov et al. in Mathematical Social Sciences (see vol. 62, 2011, 7–13).

Persistent link: https://www.econbiz.de/10011065142