150 search results - page 7 / 30 » Hybrid Constraint Tightening for Solving Hybrid Scheduling P... |
103
click to vote
MICAI
2007
Springer
15 years 5 months ago
2007
Springer
This research presents a novel approach to solve m-machine no-wait flowshop scheduling problem. A continuous flowshop problem with total flowtime as criterion is considered appl...
ACISICIS
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper addresses the problem of finding a feasible solution for the University Course Timetabling Problem (UCTP), i.e. a solution that satisfies all the so-called hard const...
113
click to vote
EOR
2010
14 years 11 months ago
2010
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many r...
FLAIRS
2004
15 years 1 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
87
Voted
CPAIOR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Constraint programming based column generation is a hybrid optimization framework recently proposed that uses constraint programming (CP) to solve column generation subpr...