Generalised Assignment Problems (GAP), traditionally solved by Integer Programming techniques, are addressed in the light of current Constraint Programming methods. A scheduling application from manufacturing, based on a modified GAP, is used to examine the performance of each technique under a vari
β¦ LIBER β¦
Solving planning and scheduling problems with combined integer and constraint programming
β Scribed by Christian Timpe
- Publisher
- Springer
- Year
- 2002
- Tongue
- German
- Weight
- 122 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0171-6468
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Constraint Logic Programming and Integer
β
Ken Darby-Dowman; James Little; Gautam Mitra; Marco Zaffalon
π
Article
π
1997
π
Springer US
π
English
β 977 KB
Solving quadratic assignment problems wi
β
Robert F. Love; Jsun Y. Wong
π
Article
π
1976
π
John Wiley and Sons
π
English
β 304 KB
## Abstract The problem considered involves the assignment of __n__ facilities to __n__ specified locations. Each facility has a given nonnegative flow from each of the other facilities. The objective is to minimize the sum of transportation costs. Assume these __n__ locations are given as points
Solving allocation and scheduling proble
β
Parviz Ghandforoush; Brian J. Greber
π
Article
π
1986
π
Elsevier Science
π
English
β 999 KB
A branch and bound algorithm with constr
β
Jeffrey L. Arthur; A. Ravindran
π
Article
π
1980
π
Elsevier Science
π
English
β 346 KB
Combining column generation and constrai
β
Sami Gabteni; Mattias GrΓΆnkvist
π
Article
π
2008
π
Springer US
π
English
β 371 KB
Solving manpower scheduling problem in m
β
Quan-Ke Pan; Ponnuthurai N. Suganthan; Tay J. Chua; T. X. Cai
π
Article
π
2009
π
Springer
π
English
β 200 KB