Scheduling subject to resource constraints: classification and complexity

  title={Scheduling subject to resource constraints: classification and complexity},
  author={Jacek Blazewicz and Jan Karel Lenstra and Alexander H. G. Rinnooy Kan},
  journal={Discret. Appl. Math.},
Abstract In deterministic sequencing and scheduling problems, jobs are to be processed on machines of limited capacity. We consider an extension of this class of problems, in which the jobs require the use of additional scarce resources during their execution. A classification scheme for resource constraints is proposed and the computational complexity of the extended problem class is investigated in terms of this classification. Models involving parallel machines, unit-time jobs and the… 
Parallel branch and bound algorithms for a class of scheduling problems
  • M. Rahoual
  • Computer Science
    Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95
  • 1995
The author presents the solution of a general type of deterministic scheduling problems which takes into account: priority constraints, resources constraints, different types of resources of which the supply can vary with time, the needs of resources that can vary during the execution of each task and performance measures which are an arbitrary non-decreasing function of the completion time of all the set of tasks.
Scheduling problems for parallel dedicated machines under multiple resource constraints
A fairly complete computational complexity classification is obtained, and a number of polynomial-time algorithms are designed to solve scheduling problems for parallel dedicated machines subject to resource constraints.
Sequencing and scheduling: algorithms and complexity
This survey focuses on the area of deterministic machine scheduling, and reviews complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops.
New trends in machine scheduling
Abstract This review is concerned with new directions in deterministic machine scheduling theory. We study: resource constrained scheduling, scheduling tasks that require more than one machine at a
Uniform Machine Scheduling of Unit-time Jobs Subject to Resource Constraints
It is shown that an approach suggested in the literature to solve the problem of scheduling a set of unit-time jobs on m uniform machines is incorrect, and an O(m log m) algorithm is presented and a linear-time algorithm for the problem with identical machines is presented.
On the Complexity of Scheduling Problems for Parallel/Pipelined Machines
The problem of optimal scheduling of a job system for two dedicated processors is presented. A machine model with two functional units which can be either sequential or pipelined is considered. The
Task Scheduling with Restricted Preemptions
This paper introduces a scheduling model that guarantees that preemption of a task is only possible after a reasonable part of the task has been processed and turns out that this problem is NP-hard in general, but very good approximation algorithms can be found and special cases can be solved exactly in polynomial time.
Scheduling two identical parallel machines with preparation constraints
The NP-hardness of two specific cases are proved, where in the first case preparation times take only three values, whereas in the second cases preparation times and the release dates take only two values, respectively.
Scheduling parallel dedicated machines under a single non-shared resource
The scheduling problem of minimizing the makespan for m parallel dedicated machines under single resource constraints is considered and heuristic algorithms employing the so-called group technology approach are presented and their worst-case behavior is examined.
Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
For problems with makespan, (weighted) mean flow time, weighted number of tardy tasks, and sum of tardiness as objective functions polynomial time algorithms are presented.


Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
The state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory are surveyed.
Complexity Results for Multiprocessor Scheduling under Resource Constraints
The main results of this paper imply that almost all cases of this scheduling problem, even with only one resource, are NP-complete and hence are as difficult as the notorious traveling salesman problem.
Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
Subroutine ARSME solves a resource constrained, network scheduling problem for the case in which activities may be arbitrarily interrupted and restarted later with no increase in activity duration.
Two Approaches to Problems of Resource Allocation Among Project Activities — A Comparative Study
Two general approaches using linear programming in specific ways for solving a class of problems of resource allocation among project activities, where the resource requirements of each activity concern numbers of resource units from given finite sets for particular resource types.
Preemptive Scheduling of Uniform Processor Systems
AaSTRACT An O(n) t~me algorithm is presented to obtain an opt,mal fimsh time preemptive schedule for n independent tasks on m uniform processors This algorithm assumes that the tasks are lnmally
On the Computational Complexity of Combinatorial Problems
  • R. Karp
  • Computer Science
  • 1975
A large class of classical combinatorial problems, including most of the difficult problems in the literature of network flows and computational graph theory, are shown to be equivalent, in the sense
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledge
An O (N2.5) algorithm for maximum matching in general graphs
  • S. Even, O. Kariv
  • Computer Science, Mathematics
    16th Annual Symposium on Foundations of Computer Science (sfcs 1975)
  • 1975
This work presents a new efficient algorithm for finding a maximum matching in an arbitrary graph that is O(m√n¿log n) where n, m are the numbers of the vertices and the edges in the graph.