A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner [2010]

Details A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner [2010] A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner [2010]

2011-12-19

arxiv.org/abs/1112.4396v1

Computer Science

Discrete Mathematics

Scientific paper

In this note, we point out two major errors in the paper "Minimizing total
tardiness on parallel machines with preemptions" by Kravchenko and Werner
[2010]. More precisely, they proved that both problems P|pmtn|sum(Tj) and P|rj,
pj = p, pmtn|sum(Tj) are NP-Hard. We give a counter-example to their proofs,
letting the complexity of these two problems open.

Affiliated with

Also associated with

No associations

Rating

A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner [2010] does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner [2010], we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner [2010] will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-212814