SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE PRIMARY CRITERION

It is well-known that a single machine scheduling problem of minimizing the total tardiness is NP-hard. Recently, Liu, Ng and Cheng solved some special hierarchical minimization problems with total tardiness as the primary criterion by the Algorithm TAP (Two Assignment Problems) in O(n3) time. And in this paper we present some algorithms for these problems with running time O(n log n).

MoreLess

Year of publication:	2010
Authors:	HE, CHENG ; LIN, YIXUN ; YUAN, JINJIANG
Published in:	Asia-Pacific Journal of Operational Research (APJOR). - World Scientific Publishing Co. Pte. Ltd., ISSN 1793-7019. - Vol. 27.2010, 05, p. 577-585
Publisher:	World Scientific Publishing Co. Pte. Ltd.
Subject:	Bicriteria scheduling \| total tardiness \| batch processing machine

Online Resource

Check full text access |

More access options

www.worldscinet.com

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Extent:	application/pdf text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10008738744