Mathematical Programming vs. Constraint Programming for Scheduling Problems
This paper focuses on a classical scheduling problem known as the job-shop scheduling problem which is one of the most difficult problems in combinatorial optimisation. The paper presents two solution techniques, namely mathematical programming and constraint programming and compares their computati...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Žilina
2013-03-01
|
| Series: | Communications |
| Subjects: | |
| Online Access: | https://komunikacie.uniza.sk/artkey/csl-201301-0007_mathematical-programming-vs-constraint-programming-for-scheduling-problems.php |