production planning is performed through diverse methods according to the type of the system it is structured upon. one of the most important steps before production planning is to determine which system best fits the firm, and how the facilities should be designed. both job-shop and group-technology systems have their own cons and pros, each of which is suitable to a specific kind of factory. ...

A distributed problem solving approach t o j o b shop scheduling is described in this paper. The approach views the system as an Organisation. Agents are assigned different roles and functions depending on their position within the structure of the Organisation. In this Organisation, agents of the same level state their interests independently of each other and therefore Conflict is likely to o...

Job Shop Scheduling is an important combinatorial optimisation problem in practice. It usually contains many (four or more) potentially conflicting objectives such as makespan and mean weighted tardiness. On the other hand, evolving dispatching rules using genetic programming has demonstrated to be a promising approach to solving job shop scheduling due to its flexibility and scalability. In th...

Typically, general job shop scheduling problems assume that working times of machines are equal, for instance eight hours a day. However, in real factories, these working times are different because the machines may have different processing speeds, or they may require maintenance. That is, one machine may need to be operated only half day whereas other machines may have to be operated for the ...

We present an idling, dynamic priority scheduling policy for non-preemptive task sets with precedence, wait constraints, and deadline constraints. The policy operates on a well-formed task model where tasks are related through a hierarchical temporal constraint structure found in many real-world applications. In general, the problem of sequencing according to both upperbound and lowerbound temp...

We consider a general class of multiprocessor shop scheduling problems, preemptive or nonpreemptive, with precedence constraints between operations, with job or operation release dates, and with a class of objective functions including weighted sums of job, operations and stage completion times. We present a general approximation method combining a linear programming relaxation in the operation...

This paper deals with the Job Shop scheduling problem with constraints of minimum and maximum Time Lags (JSTL). This problem is an extension of the job shop scheduling problem, with additional constraints of minimum and maximum time lags existing between successive operations of the same job. In this work, we investigate Parallel Tabu Searches implemented by competitive agents for the Job Shop ...

Examination of the job-shop scheduling literature uncovers a striking trend. As methods for the deterministic job-shop problem have gradually improved over the years, they have come to rely on neighbourhoods for selecting moves that are more and more constrained. We document this phenomenon with a historical sketch of job-shop neighborhoods, which leads us to focus particularly on the approach ...

A Job-Shop Scheduling is a process–organized manufacturing facility. Its main characteristics are that a great diversity of jobs is performed. A Job-Shop produces goods (parts) and these parts have one or more alternatives process plans. Each process plan consists of a sequence of a operations and these operations require resources and have certain (predefined) duration on machines. The Job-Sho...

This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search approaches for these problems has focused on developing problem specific constraint propagators and ordering heuristics. Indeed, the common belief is that many of these problems are too difficult to solve without such do...