Loading...
Please wait, while we are loading the content...
Similar Documents
Applying constraint satisfaction techniques to job shop scheduling (1995).
| Content Provider | CiteSeerX |
|---|---|
| Author | Cheng, Cheng-Chung Smith, Stephen F. |
| Abstract | In this paper, we investigate the applicability of a constraint satisfaction problem solving (CSP) model, recently developed for deadline scheduling, to more commonly studied problems of schedule optimization. Our hypothesis is two-fold: (1) that CSP scheduling techniques provide a basis for developing high-performance approximate solution procedures in optimization contexts, and (2) that the representational assumptions underlying CSP models allow these procedures to naturally accommodate the idiosyncratic constraints that complicate most real-world applications. We focus specifically on the objective criterion of makespan minimization, which has received the most attention within the job shop scheduling literature. We define an extended solution procedure somewhat unconventionally by reformulating the makespan problem as one of solving a series of different but related deadline scheduling problems, and embedding a simple CSP procedure as the subproblem solver. We first present the re... |
| File Format | |
| Publisher Date | 1995-01-01 |
| Access Restriction | Open |
| Subject Keyword | Job Shop Constraint Satisfaction Technique Csp Model Representational Assumption Subproblem Solver Deadline Scheduling Schedule Optimization Makespan Minimization Objective Criterion Constraint Satisfaction Problem Solving Optimization Context Simple Csp Procedure Idiosyncratic Constraint High-performance Approximate Solution Procedure Makespan Problem Extended Solution Procedure Real-world Application Related Deadline Scheduling Problem |
| Content Type | Text |
