An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times

Abstract

Article history: Received 19 July 2010 Received in revised form 17 June 2011 Accepted 5 August 2011 Available online 16 August 2011 Communicated by Ł. Kowalik 
DOI: 10.1016/j.ipl.2011.08.003

Topics

Cite this paper

@article{Tian2011AnOA, title={An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times}, author={Ji Tian and Ruyan Fu and Jinjiang Yuan}, journal={Inf. Process. Lett.}, year={2011}, volume={111}, pages={1048-1053} }