388 search results - page 6 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
CP
2005
Springer
14 years 2 months ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
AAAI
2007
13 years 11 months ago
2007
In recent years, planning and scheduling research has paid increasing attention to problems that involve resource oversubscription, where cumulative demand for resources outstrips...
ANOR
2008
13 years 8 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
ICA
2007
Springer
14 years 18 days ago
2007
Springer
We propose a new method for estimating the mixing matrix, A, in the linear model x(t) = As(t), t = 1, . . . , T, for the problem of underdetermined Sparse Component Analysis (SCA)....
EVOW
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The strategic supply chain design problem which allows capacity shifts and budget limitations can be formulated as a linear program. Since facilities are allowed to be op...