Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,120
Heuristics for Job-Shop Scheduling
, 1988
"... Two methods of obtaining approximate solutions to the classic General Job-Shop Scheduling Problem are investigated. The first method is iterative. A sampling of the solution space is used to decide which of a collection of space pruning constraints are consistent with "good" schedules. Th ..."
Abstract
- Add to MetaCart
Two methods of obtaining approximate solutions to the classic General Job-Shop Scheduling Problem are investigated. The first method is iterative. A sampling of the solution space is used to decide which of a collection of space pruning constraints are consistent with "good" schedules
INDUSTRIAL APPLICATIONS IN JOB SHOP SCHEDULING
, 1983
"... Artificial intelligence techniques for industrial applications in job shop scheduling. ..."
Abstract
- Add to MetaCart
Artificial intelligence techniques for industrial applications in job shop scheduling.
Job Shop Scheduling
, 1997
"... This paper spans three major approaches to job shop scheduling. Various communities have approached the problem differently: with approximation algorithms, as an integer programming problem, or as a constraint satisfaction problem (CSP). ..."
Abstract
- Add to MetaCart
This paper spans three major approaches to job shop scheduling. Various communities have approached the problem differently: with approximation algorithms, as an integer programming problem, or as a constraint satisfaction problem (CSP).
Job-Shop Scheduling
, 1997
"... Introduction Scheduling is the allocation of shared resources over time to competing activities. It has been the subject of a significant amount of literature in the operations research field. Emphasis has been on investigating machine scheduling problems where jobs represent activities and machine ..."
Abstract
- Add to MetaCart
and machines represent resources; each machine can process at most one job at a time. Table 7.1: A 3 3 problem job Operations routing (processing time) 1 1 (3) 2 (3) 3 (3) 2 1 (2) 3 (3) 2 (4) 3 2 (3) 1 (2) 3 (1) The nm minimum-makespan general job-shop scheduling problem, hereafter referred
Job-Shop Scheduling in Localizer
, 1998
"... Localizer is a domain-specific language for developing local search procedures. By automating many of the tedious tasks underlying local search algorithms, Localizer was shown to reduce the development time significantly and to preserve most of efficiency of specialized algorithms on applications su ..."
Abstract
- Add to MetaCart
such as Boolean satisfiability and graph coloring. This paper applies Localizer to job-shop scheduling to provide evidence that it can scale up to more sophisticated applications. It presents two Localizer model: an array-based model and a model based on graph-theoretic concepts. This last model illustrates how
Job Shop Scheduling with Deadlines
- Journal of Combinatorial Optimization
, 1998
"... In this paper we deal with a variant of the Job Shop Scheduling Problem. We consider the addition of release dates and deadlines to be met by all jobs. The objective is makespan minimization if there are no tardy jobs, and tardiness minimization otherwise. The problem is approached by using a Shifti ..."
Abstract
-
Cited by 11 (0 self)
- Add to MetaCart
In this paper we deal with a variant of the Job Shop Scheduling Problem. We consider the addition of release dates and deadlines to be met by all jobs. The objective is makespan minimization if there are no tardy jobs, and tardiness minimization otherwise. The problem is approached by using a
Job Shop Scheduling with Multiagents
"... Scheduling is an important aspect of automation in manufacturing systems. Various approaches have been proposed, but the problem is far from being solved satisfactorily, especially if scheduling concerns real world applications with many incompatible constraints. In this paper we discuss a multiagen ..."
Abstract
- Add to MetaCart
multiagent based approach to realistic job shop scheduling which diers in at least two aspects from recently proposed multiagent approaches. In particular we present and compare two agent cooperation strategies which dier in respect to the way the agents handle various contradictory constraints of a schedule
Handling Uncertainty in Job-Shop Scheduling
"... We discuss our proposed approach to handling uncertainty and constraints in job-shop scheduling. Specifically we deal with uncertainty in the duration of a task, as well as constraints on task completion time, task separation, etc. We discuss both offline and adaptive scheduling strategies. Our appr ..."
Abstract
- Add to MetaCart
We discuss our proposed approach to handling uncertainty and constraints in job-shop scheduling. Specifically we deal with uncertainty in the duration of a task, as well as constraints on task completion time, task separation, etc. We discuss both offline and adaptive scheduling strategies. Our
Fuzzy Constraints in Job-Shop Scheduling
- Journal of Intelligent Manufacturing
, 1995
"... : This paper proposes an extension of the constraint-based approach to job-shop 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 55 (9 self)
- Add to MetaCart
: This paper proposes an extension of the constraint-based approach to job-shop 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
Results 1 - 10
of
1,120
