Scheduling precedence constrained jobs on identical parallel machines is a well investigated problem with many applications. AND/OR-networks constitute a useful generalization of standard precedence constraints where certain jobs can be executed as soon as at least one of their direct predecessors is completed. For the problem of scheduling AND/OR-networks on parallel machines, we present a 2-a...

The Resource Constrained Project Scheduling Problem is an important problem in project management, manufacturing and resource optimization. We focus on a variant of RCPSP with time lags and uncertain activity durations. We adopt a Precedence Constraint Posting approach and add precedence constraints to the original project graph so that all resource conflicts are solved and a consistent assignm...

The Resource-constrained Project Scheduling Problem (Rcpsp), in which a schedule must obey the resource constraints and the precedence constraints between pairs of activities, is one of the most studied scheduling problems. An important variation of the problem (RcpspDc) is to find a schedule which maximises the net present value (discounted cash flow), when every activity has a given cash flow...

Formal results for precedence constrained, real-time scheduling of unit time tasks are extended to arbitrary timed tasks with preemp-tion. An exact characterisation of the EDF-like schedulers that can be used to transparently enforce precedence constraints among tasks is shown. These extended results are then integrated with a well-known protocol that handles real-time scheduling of tasks with ...

Resource Constrained Project Scheduling Problem (RCPSP) is the most general scheduling problem. Job shop scheduling, flow shop scheduling and other scheduling problems are the subsets of RCPSP. The present paper examines the multimode multi-objective resource constrained project scheduling problem (RCPSP) with partial precedence relations. To enhance the practical aspects of this prominent prob...

In this paper the resource-constrained flow shop (RCF) problem is addressed. A number of realistic extensions are incorporated, including non-serial precedence requirements, mixed flow shop situations, and the distribution of the human workforce among a number of pre-determined groups. The RCF is then solved by meta-heuristics, primarily of the evolutionary type. An extensive numerical investig...

Two binary integer programming discrete-time models and two precedence-based mixed integer programming continuous-time formulations are developed for the resource-constrained project scheduling problem. The discrete-time models are based on the definition of binary variables that describe the processing state of every activity between two consecutive time points, while the continuous-time model...

The parameterized computational complexity of a collection of well-known problems including: Bandwidth, Precedence constrained k-processor scheduling, Longest Common Subsequence, DNA physical mapping (or Intervalizing colored graphs), Perfect phylogeny (or Triangulating colored graphs), Colored cutwidth, and Feasible register assignment is explored. It is shown that these problems are hard for ...

In this paper we study a class of cooperative sequencing games that arise from one-machine sequencing situations in which chain precedence relations are imposed on the jobs. It is shown that these sequencing games are convex.