A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times

Optimization Letters

Volumn 7, Issue 3, 2013, Pages 613-616

  Rudek, Radosław ^a  

^a WROCLAW UNIVERSITY OF ECONOMICS   (Poland)

Author keywords

Computational analysis; Learning effect; Position dependent processing time; Scheduling; Strong NP hardness

Indexed keywords

HARDNESS; NP-HARD; SCHEDULING;

COMPUTATIONAL ANALYSIS; JOB PROCESSING TIME; LEARNING EFFECTS; MAKESPAN MINIMIZATION; PARTITION PROBLEM; POSITION DEPENDENTS; POSITION-DEPENDENT PROCESSING TIME; SCHEDULING PROBLEM;

JOB SHOP SCHEDULING;

EID: 84874441050     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-012-0445-0     Document Type: Article

References (6)

1. Bachman A., Janiak A.: Scheduling jobs with position dependent processing times. J. Oper. Res. Soc. 55, 257-264 (2004).
2. Farhi B., Kane D.: New results on the least common multiple of consecutive integers. P. Am. Math. Soc. 137, 1933-1939 (2009).
3. Garey M. R., Johnson D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979).
4. Hardy G. H., Wright E. M.: An Introduction to the Theory of Numbers. Oxford University Press, New York (1979).
5. Lee C.-Y., Vairaktarkis G.: Complexity of single machine hierarchical scheduling: a survey. In: Pardalos, P. M. (eds) Complexity in Numerical Optimization, pp. 269-298. World Scientific, Singapore (1993).
6. Pardalos P. M., Resende M.: Combinatorial optimization. In: Pardalos, P. M., Resende, M. (eds) Handbook of Applied Optimization, pp. 51-52. Oxford University Press, Oxford (2002).