Scheduling a single machine to minimize a regular objective function under setup constraints

Authors:
Philippe Baptiste;Claude Le Pape
Affiliations:
CNRS, UMR 7161 LIX, Ecole Polytechnique, F-91128 Palaiseau, France;ILOG, Gentilly, France
Venue:
Discrete Optimization
Year:
2005

Citing 13
Cited 5

A note on the weighted tardiness problem

Operations Research
A survey of algorithms for the single machine total weighted tardiness scheduling problem

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
A practical use of Jackson's preemptive schedule for solving the job shop problem

Annals of Operations Research
Scheduling with release dates on a single machine to minimize total weighted completion time

Discrete Applied Mathematics
Scheduling Algorithms

Scheduling Algorithms
Constraint-Based Scheduling

Constraint-Based Scheduling
Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Earliness-tardiness scheduling with setup considerations

Computers and Operations Research
Consistency techniques for numeric CSPs

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Efficient heuristics to minimize total flow time with release dates

Operations Research Letters
A decomposition algorithm for the single machine total tardiness problem

Operations Research Letters
On decomposition of the total tardiness problem

Operations Research Letters

An exact method for Pm/sds,ri/Σi=1nCi problem

Computers and Operations Research
On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups

Discrete Applied Mathematics
A global constraint for total weighted completion time for unary resources

Constraints
The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times

Discrete Optimization
Using dual presolving reductions to reformulate cumulative constraints

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by industrial applications, we study the scheduling situation in which a set of jobs subjected to release dates and deadlines are to be performed on a single machine. The objective is to minimize a regular sum objective function @?"if"i where f"i(C"i) corresponds to the cost of the completion of job J"i at time C"i. On top of this, we also take into account setup times and setup costs between families of jobs as well as the fact that some jobs can be ''unperformed'' to reduce the load of the machine. We introduce lower bounds and dominance properties for this problem and we describe a Branch and Bound procedure with constraint propagation. Experimental results are reported.