In this paper, a new schedule generation scheme for
resource-constrained project scheduling problems is proposed. Given a
project scheduling problem and a priority rule, a schedule generation
scheme determines a single feasible solution by inserting one by one
each activity, according to their priority, inside a partial
schedule. The paper proposes a generation scheme that differs from the
classic ones in the fact that it allows to consider the activities in
any order, whether their predecessors...
This paper considers the problem of scheduling jobs on a single machine. A fixed processing time and an execution interval are associated with each job. Preemption is not allowed. The objective is to find a feasible job sequence that minimizes the number of tardy jobs. On the basis of an original mathematical integer programming formulation, this paper shows how good-quality lower and upper bounds can be computed. Numerical experiments are provided for assessing the proposed approach.
This paper considers the problem of scheduling jobs on a single
machine. A fixed processing time and an execution interval are
associated with each job. Preemption is not allowed. On the basis
of analytical and numerical dominance conditions, an efficient
integer linear programming formulation is proposed for this
problem, aiming at minimizing the maximum lateness
(
). Experiments have been performed by
means of a commercial solver that show that this formulation is
effective...
Download Results (CSV)