A SEMI-ON-LINE SCHEDULING PROBLEM OF TWO PARALLEL MACHINES WITH COMMON MAINTENANCE TIME

In this paper, we consider a semi-on-line scheduling problem of two identical machines with common maintenance time interval and nonresumable availability. We prove a lower bound of 2.79129 on the competitive ratio and give an on-line algorithm with competitive ratio 2.79633 for this problem.

MoreLess

Year of publication:	2012
Authors:	CAI, YUHUA ; FENG, QI ; LI, WENJIE
Published in:	Asia-Pacific Journal of Operational Research (APJOR). - World Scientific Publishing Co. Pte. Ltd., ISSN 1793-7019. - Vol. 29.2012, 04, p. 1250020-1
Publisher:	World Scientific Publishing Co. Pte. Ltd.
Subject:	Semi-on-line scheduling \| on-line algorithm \| competitive ratio \| common maintenance time

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/10010567094