Displaying similar documents to “Minimizing the earliness and tardiness cost of a sequence of tasks on a single machine”

An efficient ILP formulation for the single machine scheduling problem

Cyril Briand, Samia Ourari, Brahim Bouzouia (2010)

RAIRO - Operations Research

Similarity:

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...

A new schedule generation scheme for resource-constrained project scheduling

Cyril Briand (2009)

RAIRO - Operations Research

Similarity:

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...