The Container Drayage Problem (CDP) aims at routing a fleet of trucks, based common terminal, to serve customers while minimizing the total travel distance. Each trip starts from and ends handles subset customers. customer requires either that container is picked up or delivered. We introduce more realistic variant, i.e., Multi-trip Multi-period CDP with Release Due Dates (MM-CDP-RDD), in which...

Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation. The constraint-propagation step is a fixpoint algorithm that applies pruning operators to tighten the release and due dates of activities using precedence or resource constraints. A variety of pruning operators for re...

The paper considers the problem of scheduling n jobs on a single machine to minimize the number of tardy jobs (or late jobs). Each job has a release date, a processing time and a due date. The general case with non-equal release dates and diierent due dates is considered. Various mixed-integer linear programming formulations are presented and discussed. A new polynomial solvable case is also in...