论文信息 - A note on "Single-machine scheduling with general learning functions"

A note on "Single-machine scheduling with general learning functions"

Some results in a recent paper [J.-B. Wang Single-machine scheduling with general learning functions, Computers and Mathematics with Applications 56 (2008) 1941-1947] are incorrect because job processing times are variable due to general learning functions. In this note, we show by a counter-example that the results are incorrect.

Na Yin | Xue Huang

[1] J. M. Moore. An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[2] Ji-Bo Wang,et al. Single-machine scheduling with general learning functions , 2008, Comput. Math. Appl..

[3] Christos Koulamas,et al. Single-machine and two-machine flowshop scheduling with general learning functions , 2007, Eur. J. Oper. Res..