Loading...
Please wait, while we are loading the content...
Constraint programming search procedure for earliness/tardiness job shop scheduling problem.
| Content Provider | CiteSeerX |
|---|---|
| Author | Kelbel, Jan Hanzálek, Zdeněk |
| Abstract | This paper describes a constraint programming approach to solving a scheduling problem with earliness and tardiness cost using a problem specific search procedure. The presented algorithm is tested on a set of randomly generated instances of the job shop scheduling problem with earliness and tardiness costs. The experiments are executed also for three other algorithms, and the results are then compared. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Constraint Programming Search Procedure Tardiness Cost Problem Specific Search Procedure Scheduling Problem Presented Algorithm Job Shop |
| Content Type | Text |
| Resource Type | Article |