Constraint Logic Programming and Integer Programming approaches and their collaboration in solving an assignment scheduling problem | Zendy

K Darby-Dowman | Zendy; James Little | Zendy; Gautam Mitra | Zendy; Marco Zaffalon | Zendy

Open Access

Constraint Logic Programming and Integer Programming approaches and their collaboration in solving an assignment scheduling problem

Author(s) -

K Darby-Dowman,

James Little,

Gautam Mitra,

Marco Zaffalon

Publication year - 1997

Publication title -

constraints

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.624

H-Index - 46

eISSN - 1572-9354

pISSN - 1383-7133

DOI - 10.1007/bf00137871

Subject(s) - integer programming , constraint programming , computer science , concurrent constraint logic programming , constraint satisfaction , mathematical optimization , scheduling (production processes) , constraint logic programming , logic programming , set (abstract data type) , inductive programming , programming paradigm , theoretical computer science , programming language , mathematics , algorithm , artificial intelligence , stochastic programming , probabilistic logic

Generalised Assignment Problems (GAP), traditionally solved by Integer Programmingtechniques, are addressed in the light of current Constraint Programming methods. Ascheduling application from manufacturing, based on a modified GAP, is used to examinethe performance of each technique under a variety of problem characteristics.Experimental evidence showed that, for a set of assignment problems, Constraint LogicProgramming (CLP) performed consistently better than Integer Programming (IP)....

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research