RESCHEDULING WITH RELEASE DATES TO MINIMIZE TOTAL SEQUENCE DISRUPTION UNDER A LIMIT ON THE MAKESPAN

In this paper, we consider the rescheduling problem for jobs on a single machine with release dates to minimize total sequence disruption under a limit on the makespan. We show that the considered problem can be solved in polynomial time. Consequently, the rescheduling problem for jobs on a single machine with release dates to minimize makespan under a limit on the total sequence disruption can also be solved in polynomial time.

MoreLess

Year of publication:	2007
Authors:	YUAN, JINJIANG ; MU, YUNDONG ; LU, LINGFA ; LI, WENHUA
Published in:	Asia-Pacific Journal of Operational Research (APJOR). - World Scientific Publishing Co. Pte. Ltd., ISSN 1793-7019. - Vol. 24.2007, 06, p. 789-796
Publisher:	World Scientific Publishing Co. Pte. Ltd.
Subject:	Rescheduling \| makespan \| single machine \| release dates \| disruption

More details

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

Persistent link: https://ebvufind01.dmz1.zbw.eu/10005080675