Technical Note—Optimal Scheduling of Periodic Activities

Kyung S. Park and Doek K. Yun
Additional contact information
Kyung S. Park: Korea Advanced Institute of Science (Technology), Seoul, Korea
Doek K. Yun: Hanyang University, Seoul, Korea

Operations Research, 1985, vol. 33, issue 3, 690-695

Abstract: This paper studies the scheduling of multiple activities that require periodic processing on a single facility for an infinite horizon. It first formulates this scheduling problem as an integer linear programming (ILP) model, and then uses the Chinese Remainder Theorem to efficiently partition the original into smaller independent models. For a small problem involving about 10 activities, the solution can be obtained very simply by hand. An example is given to illustrate the approach.

Keywords: 181 facility capacity for periodic activities; 359 optimal scheduling of periodic activities; 633 partitioning of integer linear program (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.33.3.690 (application/pdf)

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:inm:oropre:v:33:y:1985:i:3:p:690-695

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().