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

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

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

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

References

Kise H., Ibaraki T., Mine H. A solvable case of the one-machine scheduling problem with ready and due times. Oper. Res. (1978) 26(1):121–126Link, Google Scholar
Li S., Chen Z.-L., Tang G. Optimality proof of the Kise-Ibaraki-Mine algorithm. (2009) . Working paper, Robert H. Smith School of Business, University of Maryland, College ParkGoogle Scholar

March-April 2010

Pages iii-514

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.