## Abstract This paper deals with the sequencing problem of minimizing linear delay costs with parallel identical processors. The theoretical properties of this mβmachine problem are explored, and the problem of determining an optimum scheduling procedure is examined. Properties of the optimum sche
Scheduling with variable time slot costs
β Scribed by Guohua Wan; Xiangtong Qi
- Publisher
- John Wiley and Sons
- Year
- 2010
- Tongue
- English
- Weight
- 159 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We address a single-machine scheduling problem in which penalties are assigned for early and tardy completion of jobs. These penalties are common in industrial settings where early job completion can cause the cash commitment to resources in a time frame earlier than needed, giving rise to early com
Algorithms for arbitrating and scheduling transmissions from different transmitters sharing a common access medium arise often in the design of many shared and distributed systems. In this paper we present a distributed algorithm for arbitrating time-constrained transmissions on slotted shared acces