Parrello, B. D., and Kabat, W. C. Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem. Journal of Automated Reasoning 2, 1 (1986), 1-42.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....golfer on more than one occasion. 16 The problem can be generalized to that of scheduling m groups of n golfers over p weeks, such that no golfer plays in the same group as any other golfer twice. The car sequencing problem The car sequencing problem is mentioned in work by Parrello and Kabat [40], Dincbas et al. 8] Gent [16] R egin [42] and Lee et al. 31] In CSPLib it is described as follows. A number of cars are to be produced; they are not identical, because di erent options are available as variants on the basic model. The assembly line has di erent stations which install the ....

Parrello, B. D., and Kabat, W. C. Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem. Journal of Automated Reasoning 2, 1 (1986), 1-42.

....The results clearly indicate that the implementation is extremely competitive with low level encodings of the algorithm [5] and is quadratic in time experimentally. 4. CAR SEQUENCING Our second application is the car sequencing problem, a challenging combinatorial optimization application [20, 7]. The main goal of this example is to produce evidence that hard combinatorial optimization are amenable to e ective solutions within the architecture. Once again, the problem statement is short and concise, and it contains a di erentiable object for a combinatorial substructure that arises in ....

B. Parrello, W. Kabat, and L. Wos. Job-Shop Scheduling Using Automated Reasoning: A Case Study of the Car-Sequencing Problem. Journal of Automated Reasoning, 2(1):1-42, 1986.

.... The goal of the CSP is then to identify an optimal sequence of cars on the assembly line such that the demands for each of the models are met (hard constraints) and the separation rules are satisfied as closely as possible (soft constraints) A similar problem has been studied by Parretto et al. [27] using automated reasoning, and many assembly line balancing problems have been solved using various approximate algorithms [15] 24] To the best of our knowledge, there is no literature SMITH et al. NEURAL TECHNIQUES FOR COMBINATORIAL OPTIMIZATION 1309 relating to the use of nonlinear ....

B. D. Parretto, W. Kabat, and L. Wos, "Jobshop scheduling using automated reasoning: A case study of the car sequencing problem," J. Automated Reasoning, vol. 2, pp. 1--42, 1986.

....to design a simple algorithm whose behavior is similar in spirit to some of the best algorithms for the task and whose eciency is competitive with specialized implementations of these algorithms. The second problem, car sequencing, was motivated by its presentation as a challenge for AI tools [48, 49]. We propose a solution to this problem that can be described concisely in constraint logic programming and whose eciency enables to solve large instances. The CLP language used in the above problems is cc(FD) an instance of the cc framework over nite domains that is best seen as a successor to ....

B.D. Parrello, W.C. Kabat, and L. Wos. Job-Shop Scheduling Using Automated Reasoning: A Case Study of the Car-Sequencing Problem. Journal of Automated Reasoning, 2(1):1-42, 1986.

....vehicles on its assembly lines [19] Once again there is no detailed information about this research, and there is 1 unlikely to be any more in the future. The majority of research has focused on a particular problem referred to as the Car Sequencing problem, introduced by Parrello and Kabat in [14]. It is unclear if this is a real world problem since Parrello and Kabat give no mention of its origin. The problem consists of sequencing different types of vehicles that are to be produced on an assembly line. Each vehicle that is produced requires that certain options be installed (e.g. air ....

....2:5. This means that for any subsequence of five vehicles, only two of them can be vehicles that require a sun roof. For problem instances containing up to 200 vehicles, it is often the case that solutions do not exist. To deal with this, the problem can be defined as an optimization problem. In [14], Parrello and Kabat redefine the capacity constraints to incur a penalty value whenever a constraint is not satisfied. The weight of this penalty value depends on the option that the constraint is defined for (violating a constraint for some options is more expensive than others) how many ....

[Article contains additional citation context not shown here]

B. D. Parrello and W. C. Kabat. Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem. Journal of Automated Reasoning, 2:1--42, 1986.

....in spite of its importance, there has been little work reported specifically on the vehicle assembly line sequencing problem in the literature. Of the work that has been reported, most has focused on the specification of the vehicle assembly line sequencing problem introduced by Parrello et al. [6]. Van Hentenryck et al. 10] and R egin and Puget [7] solve this version of the problem using backtracking search with specialized propagators to maintain arc consistency during the search. Local search techniques have also been developed for this version of the problem including a hill climbing ....

B. D. Parrello et al. Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem. J. of Automated Reasoning, 2:1--42, 1986.

....in spite of its importance, there has been little work reported speci cally on the vehicle assembly line sequencing problem in the literature. Of the work that has been reported, most has focused on the speci cation of the vehicle assembly line sequencing problem introduced by Parrello et al. [6]. Van Hentenryck et al. 10] and R egin and Puget [7] solve this version of the problem using backtracking search with specialized propagators to maintain arc consistency during the search. Local search techniques have also been developed for this version of the problem including a hill climbing ....

B. D. Parrello et al. Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem. J. of Automated Reasoning, 2:1-42, 1986.

....not be worthwhile for all problems. We compared SwapGenet and Genet the car sequencing problem, and present results below. The car sequencing problem The car sequencing problem is a real life general csp which is considered particularly difficult due to the presence of global atmost constraints (Parrello Kabat, 1986; Dincbas et al. 1988) In modern car production, cars are placed on conveyor belts which move through different work areas. Each of these work areas specialises to do a particular job, such as fitting sunroofs, car radios or air conditioners. When a car enters a work area, a team of engineers in ....

Parrello, B., & Kabat, W. C. (1986). Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem. Journal of Automated Reasoning, 2, 1--42.

....principles, i.e. fail first for variable ordering, succeed first for value ordering, do not always apply. 2 The Car Sequencing Problem The car sequencing problem arises from the manufacture of cars on an assembly line; the following description is based on that given by Parrello, Kabat and Wos [9]. A number of cars are to be produced; they are not identical, because different options are available as variants on the basic model. The assembly line has different stations which install the various options (air conditioning, sun roof, etc. These stations have been designed to handle at most ....

....iteration and choose the next car to place in the sequence accordingly, might do still better. 9 Related Work A number of techniques other than constraint programming have been applied to the car sequencing problem described here, or variants of it. The original paper by Parrello, Kabat Wos [9] used automated reasoning, incorporating inference rules and a special purpose solution strategy. David and Chew [1, 3] describe a number of problems arising from production planning for Renault; they describe a more complex type of car sequencing problem, involving approximately 750 cars per day, ....

B. D. Parrello, W. C. Kabat, and L. Wos. Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem. Journal of Automated reasoning, 2:1--42, 1986.

....open benchmark problem proposed by Smith has no solution. 1 Introduction The car sequencing problem is based on the problem of customising individual cars on a production line, and goes back in the constraint programming community to [1] having previously been defined by Parello, Kabat and Wos [5, 6]. More recently, the problem has again attracted attention as it provides fertile ground for the study of formulations and search methods [7, 8] Each car requires some subset of the set of possible customising options . We must schedule the order of cars to be put on the line. Unfortunately each ....

B.D. Parello, W.C. Kabat, and L. Wos. Job-shop scheduling using automated reasoning. Journal of Automated Reasoning, 2(1):1--42, 1986. Cited in [1].

....is to show how GENET can be applied to non binary highly complex problems. For clarity, we will describe only a simplified version of our experiments. The car sequencing problem is a highly constrained problem appearing in GM production lines and considered intractable by earlier researchers [14]. Cars to be manufactured can be classified into different types (models) with each type requiring different options (e.g. sun roof, radio, etc. to be installed. Production requirements specify the number of cars of each type to be manufactured. The problem is to position the cars to be ....

Parrello, B.D., Kabat, W.C. & Wos, L., "Job-shop scheduling using automated reasoning: a case study of the car sequencing problem", Journal of Automatic Reasoning, 2(1), 1986, 1-42

....3 may be placed in slots 2 or 3. Class 6 cannot be placed in slot 2 because of the capacity of option 1. The slot with most constrained domain is slot 2: it can only be instantiated with classes 2, 3, or 4. Van Hentenryck et al. 1992) and automated reasoning to produce near optimal solutions (Parrello et al. 1986). Table 1 shows a particular car sequencing problem taken from (Van Hentenryck et al. 1992) The number of classes, number of options, capacities of the option stations, and options required by each class were fixed. The number of each cars in each class and total number of cars to schedule were ....

....sequences. Each of the problem instances was feasible in that no option station needed to be overdriven. In a real assembly plant, however, it may be necessary to schedule a set of cars even when no feasible schedules exist. In this case, which stations to overdrive becomes the central decision. Parrello et al. 1986) proposed a method based on overdrive penalties. Stations that could recover quickly produced lower penalties than stations that became saturated. The problem thus reduces to finding a schedule with the minimum total penalty, which is an NP hard problem. Evolutionary neural networks could be very ....

Parrello, B. D., Kabat, W. C., and Wos, L. (1986). Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem. Journal of Automated Reasoning, 2:1--42.

....we describe how can we represent two types of general constraint, the illegal constraint and the atmost constraint, in a genet network. One of our motivations for devising these particular constraints has been the Car Sequencing Problem, a real life general csp once considered intractable (Parrello Kabat 1986) and which has been successfully tackled using csp solving techniques (Dincbas, Simonis, Van Hentenryck 1988) Since we cannot represent general constraints by binary connections alone, we introduce a new class of nodes called constraint nodes. A constraint node is connected to one or more label ....

Parrello, B., and Kabat, W. C. 1986. Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem. JOURNAL of Automated Reasoning 2:1--42.

....simple ground terms, a multilayer structured network will be required. The number of layers required depends on the complexity of the value structure. We have performed preliminary tests in applying GENET to networks constructed (by the experimenters) for instances of the car sequencing problem [8, 24]. Like all the other tests so far, GENET finds solutions in those networks. Our approach to the car sequencing problem is outlined in [20] Our long term research direction is to fabricate VLSI neuro chips for constructing CSP solvers for real life applications. 7 Concluding Summary We have ....

Parrello, B.D., Kabat, W.C. & Wos, L., "Job-shop scheduling using automated reasoning: a case study of the car sequencing problem", Journal of Automatic Reasoning, 2(1), 1986, 1-42

....variables and values are bound affects when a contradiction is found, choosing variable and value binding wisely can have a significant impact on the time required to find a solution. SANE was implemented to direct a depth first search in the car sequencing problem (Van Hentenryck et al. 1992; Parrello et al. 1986), which is known to be NP Complete. At each level of the search, SANE s networks decided the order in which values should be applied to variables. More specifically, SANE decided the order that classes of cars should be applied to an assembly line. SANE used only the number of backtracks over an ....

Parrello, B. D., Kabat, W. C., and Wos, L. (1986). Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem. Journal of Automated Reasoning, 2:1--42.

....As a first step in handling general non binary constraints, Davenport et al. 16] extend GENET with the illegal and the atmost constraints. The enhanced GENET [16] is shown to be effective and efficient in solving such hard CSP s as hard graph coloring problems [18] and the car sequencing problem [19]. A general scheme for handling non binary constraints in GENET does not exist. Although nonbinary constraints with finite domain variables can readily be transformed into binary constraints [20] the resulting GENET network of the transformed CSP is usually several orders of magnitude larger than ....

B.D. Parrello, W.C. Kabat, and L. Wos, "Jobshop scheduling using automated reasoning: a case study of the car sequencing problem", Journal of Automated Reasoning, vol. 2, pp. 1--42, 1986.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC