登入
選單
返回
Google圖書搜尋
Integer Programming and Constraint Programming in Solving a Multi-Machine Assignment Scheduling Problem With Deadlines and Release Dates
Ruslan Sadykov
Laurence A. Wolsey
出版
SSRN
, 2007
URL
http://books.google.com.hk/books?id=XWTazwEACAAJ&hl=&source=gbs_api
註釋
We consider both branch-and-cut and column generation approaches for the problem of finding a minimum cost assignment of jobs with release dates and deadlines to unrelated parallel machines. Results are presented for several variants both with and without Constraint Programming. Among the variants, the most effective strategy is to combine a tight and compact, but approximate, Mixed Integer Programming formulation with a global constraint testing single machine feasibility. All the algorithms have been implemented in the Mosel modelling and optimization language.
