Scheduling coupled tasks

Roy D. Shapiro

Naval Research Logistics Quarterly, 1980, vol. 27, issue 3, 489-498

Abstract: Consider a set of task pairs coupled in time: a first (initial) and second (completion) tasks of known durations with a specified time between them. If the operator or machine performing these tasks is able to process only one at a time, scheduling is necessary to insure that no overlap occurs. This problem has a particular application to production scheduling, transportation, and radar operations (send‐receive pulses are ideal examples of time‐linked tasks requiring scheduling). This article discusses several candidate techniques for schedule determination, and these are evaluated in a specific radar scheduling application.

Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
https://doi.org/10.1002/nav.3800270312

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:wly:navlog:v:27:y:1980:i:3:p:489-498

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().