Scheduling with release dates on a single machine to minimize total weighted completion time
Discrete Applied Mathematics
Scheduling Algorithms
Constraint-Based Scheduling
An exact approach to early/tardy scheduling with release dates
Computers and Operations Research
On single-machine scheduling without intermediate delays
Discrete Applied Mathematics
Consistency techniques for numeric CSPs
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Exact resolution of the one-machine sequencing problem with no machine idle time
Computers and Industrial Engineering
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem
Operations Research Letters
Homogeneously non-idling schedules of unit-time jobs on identical parallel machines
Discrete Applied Mathematics
| Hi-index | 0.00 |
We address the one-machine scheduling problem with release dates, in which the machine is subject to the non-idling constraint, i.e. no intermediate idle time is permitted between the jobs processed by the machine. The objective is to minimize a regular objective function. We describe a constraint programming approach for solving this type of problem exactly. Some necessary and/or sufficient conditions for obtaining non-idling semi-active, active and optimal schedules are described. We propose some propagation rules based on these properties. As an application, we apply the proposed method to the total (weighted) completion time problem, and we provide some experimental results to illustrate its effectiveness.