Recovering cyclic schedules from delay

R. Wegner

Annals of Operations Research, 1999, vol. 92, issue 0, 143-164

Abstract: A closed single‐server system is considered in which n items are scheduled to circulateat a fixed period. Each service is recognizable and is scheduled for its individual point of time;it is non‐preemptive and its length depends only on which item is being served.Aberratingfrom this desired schedule, some of the items start out with delays. While an item isdelayed,the time between a departure it makes from the server and its next arrival at the server isshortened by an item‐specific parameter. The aim is to recover the regular schedule asearlyas possible, or minimizing the sum of delays on services. All services must be executedeven if delayed.A greedy algorithm for a tractable subproblem is given. The overall problem is proved Σ 2 -hard; some subproblems are proved NP-hard. For one ofthe latter, an approximationalgorithm is given whose performance ratio approaches one if the maximum delay is largeenough relative to other parameters. It is proved that without this natural restriction,therecan be no algorithm with asymptotic performance ratio one. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018978529821 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:92:y:1999:i:0:p:143-164:10.1023/a:1018978529821

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018978529821

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().