Note—A Note on Shwimer's Theorem A

In 1972 Joel Shwimer published some interesting research “on the n-job, one-machine, sequence-independent scheduling problem with tardiness penalties … where the goal is to minimize the total penalty costs resulting from the tardiness of the jobs” (Shwimer, J. 1972. On the n-job, one-machine, sequence-independent scheduling problem with tardiness penalties: a branch-bound solution. Management Sci. 18 (6) B-301–B313.). The proposed algorithm is essentially based on his Theorem A. Unfortunately the given proof of Theorem A contains an inconsistency. In this note we present a different proof of the mentioned theorem.

• 저널Management Science · 23(6) · 660–661
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.23.6.660
• 저자Werner Dinkelbach, Otto Rosenberg