Scheduling multiprocessor tasks with chain constraints
Article Abstract:
The problem of scheduling dependent and nonpreemptable tasks subject to chain-like precedence constraints was investigated. Specifically, it was shown that the problem of minimizing the scheduling length or makespan for tasks with unit processing times and arbitrary processor requirements is NP-hard even for three processors. However, it may be solved in low-order polynomial time O(N log N) time if the processor requirements of tasks within a chain are either monotonically increasing/decreasing or uniform.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
A note on "Hierarchical Models for Multi-Project Planning and Scheduling."(Scheduling in Computer and Manufacturing Systems)
Article Abstract:
The branch-and-bound algorithm developed by M.G. Speranza and C. Vercellis for generating makespan minimal solutions to multi-mode resource-constrained project scheduling problems is revisited. Specifically, it is shown that the algorithm does not always derive optimal solutions because it sometimes does not take into account 'all the optimal tight schedules.' The algorithm employs maximal extensions of partial schedules to obtain tight schedules.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
A multiple-tree search procedure for the resource-constrained project scheduling problem
Article Abstract:
A parallel algorithm for solving the combinatorial problem of scheduling projects under conditions of limited resource availability is introduced. The procedure exploits multiple parallel processors and solutions trees to search for a minimum duration schedule. Although it may be applied to problems with varying resource availability, it results in faster solution times for problems characterized by constant resource availability.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: The changing process of internationalisation in the European Union. Towards a taxonomy of international retail alliances
- Abstracts: Southern comfort: Deng is still the toast of Guangdong. Model privatization: Guangdong leads China's state-enterprise sell-off
- Abstracts: Teaching the art of service. Bangkok's Oriental Hotel rolls up its sleeves and buffs up meticulous service as rivals lurk
- Abstracts: Italy forges ahead with privatisation of INA. Utility sales encounter roadblocks
- Abstracts: Getting on with it. Soaring ambition