A Note on the Optimality Proof of the Kise-Ibaraki-Mine Algorithm

Shanlin Li
Shanlin Li
[email protected]
Department of Mathematics, Taizhou University, Taizhou, Zhejiang 317000, China
Search for more papers by this author
,
Zhi-Long Chen
Zhi-Long Chen
[email protected]
Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742
Search for more papers by this author
,
Guochun Tang
Guochun Tang
[email protected]
Institute of Management Engineering, Shanghai Second Polytechnic University, Shanghai 201209, China
Search for more papers by this author

Shanlin Li

[email protected]

Department of Mathematics, Taizhou University, Taizhou, Zhejiang 317000, China

Search for more papers by this author

,

Zhi-Long Chen

[email protected]

Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742

Search for more papers by this author

,

Guochun Tang

[email protected]

Institute of Management Engineering, Shanghai Second Polytechnic University, Shanghai 201209, China

Search for more papers by this author

Published Online:8 Dec 2009https://doi.org/10.1287/opre.1090.0749

Abstract

We give a counterexample to show that the optimality proof by Kise et al. (1978) for an algorithm for a scheduling problem is incorrect.

cover image Operations Research

Volume 58, Issue 2

March-April 2010

Pages iii-514

Article Information

Metrics

Information

Received:December 01, 2008
Accepted:June 01, 2009
Published Online:December 08, 2009

Copyright © 2010, INFORMS

Cite as

Shanlin Li, Zhi-Long Chen, Guochun Tang, (2009) A Note on the Optimality Proof of the Kise-Ibaraki-Mine Algorithm. Operations Research 58(2):508-509.

https://doi.org/10.1287/opre.1090.0749

Keywords