×

The assignment of individual renewable resources in scheduling. (English) Zbl 1056.90058

Summary: Resource constrained scheduling problems are concerned with the allocation of limited resources to tasks over time. The solution to these problems is often a sequence, resource allocation, and schedule. When human workers are incorporated as a renewable resource, the allocation is defined as the number of workers assigned to perform each task. In practice, however, this solution does not adequately address how individual workers are to be assigned to tasks. This paper, therefore, provides mathematical models and heuristic techniques for solving this multi-period precedence constrained assignment problem. Results of a significant numerical investigation are also presented.

MSC:

90B35 Deterministic scheduling theory in operations research
90C59 Approximation methods and heuristics in mathematical programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Alfares H. K., Asia Pacific Journal of Operations Research 20 pp 1–
[2] Ahuja R. K., Network Flows: Theory, Algorithms, and Applications (1993) · Zbl 1201.90001
[3] Bailey R. N., Asia Pacific Journal of Operations Research 14 pp 27–
[4] Bertsekas D., Linear Network Optimisation: Algorithms and Codes (1991) · Zbl 0754.90059
[5] DOI: 10.1016/S0377-2217(98)00028-9 · Zbl 0948.90095 · doi:10.1016/S0377-2217(98)00028-9
[6] DOI: 10.1023/A:1018925411397 · Zbl 0895.90103 · doi:10.1023/A:1018925411397
[7] DOI: 10.1287/opre.42.3.504 · Zbl 0809.90076 · doi:10.1287/opre.42.3.504
[8] DOI: 10.1080/00207548908942574 · doi:10.1080/00207548908942574
[9] Martello S., Knapsack Problems: Algorithms and Computer Implementations (1990)
[10] Mokotoff E., Asia Pacific Journal of Operations Research 18 pp 193–
[11] Pinedo M., Scheduling Theory, Algorithms and Systems (1995)
[12] DOI: 10.1016/S0377-2217(00)00230-7 · Zbl 0979.90057 · doi:10.1016/S0377-2217(00)00230-7
[13] DOI: 10.1016/S0377-2217(97)00091-X · Zbl 0943.90022 · doi:10.1016/S0377-2217(97)00091-X
[14] Seong D., Pacific Journal of Operations Research 17 pp 169–
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.