Results 1 
3 of
3
Fuzzy Constraints in JobShop Scheduling
 Journal of Intelligent Manufacturing
, 1995
"... : This paper proposes an extension of the constraintbased approach to jobshop scheduling, that accounts for the flexibility of temporal constraints and the uncertainty of operation durations. The set of solutions to a problem is viewed as a fuzzy set whose membership function reflects preference. ..."
Abstract

Cited by 52 (9 self)
 Add to MetaCart
: This paper proposes an extension of the constraintbased approach to jobshop scheduling, that accounts for the flexibility of temporal constraints and the uncertainty of operation durations. The set of solutions to a problem is viewed as a fuzzy set whose membership function reflects preference. This membership function is obtained by an egalitarist aggregation of local constraintsatisfaction levels. Uncertainty is qualitatively described is terms of possibility distributions. The paper formulates a simple mathematical model of jobshop scheduling under preference and uncertainty, relating it to the formal framework of constraintsatisfaction problems in Artificial Intelligence. A combinatorial search method that solves the problem is outlined, including fuzzy extensions of wellknown lookahead schemes. 1. Introduction There are traditionally three kinds of approaches to jobshop scheduling problems: priority rules, combinatorial optimization and constraint analysis. The first kind ...
ProfileBased Algorithms to Solve Multiple Capacitated Metric Scheduling Problems
 In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems (AIPS98
, 1998
"... Though CSP scheduling models have tended to assume fairly general representations of temporal constraints, most work has restricted attention to problems that require allocation of simple, unitcapacity resources. This paper considers an extended class of scheduling problems where resources hav ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Though CSP scheduling models have tended to assume fairly general representations of temporal constraints, most work has restricted attention to problems that require allocation of simple, unitcapacity resources. This paper considers an extended class of scheduling problems where resources have capacity to simultaneously support more than one activity, and resource availability at any point in time is consequently a function of whether sufficient unallocated capacity remains. We present a progression of algorithms for solving such multiplecapacitated scheduling problems, and evaluate the performance of each with respect to problem solving ability and quality of solutions generated. A previously reported algorithm, named the Conflict Free Solution Algorithm (CFSA), is first evaluated against a set of problems of increasing dimension and is shown to be of limited effectiveness.
Scheduling MultiCapacitated Resources under Complex Temporal Constraints
, 1998
"... Most CSP scheduling models make the restrictive assumption that a resource can only support a single activity at a time (i.e., it is either available or inuse). However, in many practical domains, resources in fact have the capability to simultaneously support multiple activities, and hence availab ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Most CSP scheduling models make the restrictive assumption that a resource can only support a single activity at a time (i.e., it is either available or inuse). However, in many practical domains, resources in fact have the capability to simultaneously support multiple activities, and hence availability at any point is a function of unallocated capacity. In this paper, we develop and evaluate algorithms for solving multicapacitated scheduling problems. We first define a basic CSP model for this extended problem class, which provides a basic framework for formulating alternative solution procedures. Using this model, we then develop variants of two different solution approaches that have been recently proposed in the literature: (1) a profilebased procedure  which relies on local analysis of potential resource conflicts to heuristically direct the problem solving process, and (2) a cliquebased procedure  which exploits a global analysis of resource conflicts at greater computation...