Multiple-Project Scheduling with Controllable Project Duration and Hard Resource Constraint: Some Solvable Cases

• Published in: Annals of operations research Vol. 102; no. 1-4; pp. 287 - 307
• Main Authors: Lee, Chung-Yee, Lei, Lei
• Format: Journal Article
• Language: English
• Published: New York Springer Nature B.V 01.02.2001
• Subjects: Algorithms; Application service providers; Approximation; Costs; Customer relationship management; Customer services; Graph representations; Heuristic; Job shops; Operations research; Project management; Projects; Resource allocation; Schedules; Scheduling; Studies
• ISSN: 0254-5330; 1572-9338
• DOI: 10.1023/A:1010918518726

In many large-scale project scheduling problems, multiple projects are either taking place at the same time or scheduled into a tight sequence in order to efficiently share a common resource. One example of this is the computing resource allocation at an Application Service Provider (ASP) which provides data processing services for multiple paying customers. Typical services provided by ASPs are data mining, payroll processing, internet-based storage backup services and Customer Relation Management (CRM) services. The processing mode of an ASP can be either batch or concurrent, depending on the type service rendered. For example, for CPU intensive or long processing time required services, it would be more economical to processes one customer request at a time in order to minimize the context switching overhead. While the data transaction processes within a service request are subject to certain precedence relationships, the requests from different customers to an ASP are independent of each other, and the total time required to process a service request depends on the computing resource allocated to that request. The related issue of achieving an optimal use of resources at ASPs leads to problem of project scheduling with controllable project duration. In this paper, we present efficient algorithms for solving several special cases of such multi-project scheduling problems with controllable project duration and hard resource constraints. Two types of problems are considered. In type I, the duration of each project includes a constant and a term that is inversely proportional to the amount of resource allocated. In type II, the duration of each individual project is a continuous decreasing function of the amount of resource allocated. [PUBLICATION ABSTRACT]