908 search results - page 49 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
136
click to vote
CPAIOR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
PPSN
2000
Springer
15 years 5 months ago
2000
Springer
Domain knowledge is essential for successful problem solving and optimization. This paper introduces a framework in which a form of automatic domain knowledge extraction can be im...
115
click to vote
NIPS
1997
15 years 3 months ago
1997
Program execution speed on modern computers is sensitive, by a factor of two or more, to the order in which instructions are presented to the processor. To realize potential execu...
106
click to vote
INFORMATICALT
2006
15 years 1 months ago
2006
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization p...
132
click to vote
IPCO
2004
15 years 3 months ago
2004
Managing an industrial production facility requires carefully allocating limited resources, and gives rise to large, potentially complicated scheduling problems. In this paper we c...