Practical Constraint Satisfaction Problems (CSPs) such as design of integrated circuits or scheduling generally entail large search spaces with hundreds or even thousands of variables, each with hundreds or thousands of possible values. Often, only a very tiny fraction of all these possible assignments participates in a satisfactory solution. This article discusses techniques that aim at reduci...

Scheduling involves the allocation of resources over a period of time to perform a collection of tasks (Baker, 1974). It is a decision-making process that plays an important role in most manufacturing and service industries (Pinedo, 2005). Scheduling in the context of manufacturing systems refers to the determination of the sequence in which jobs are to be processed over the production stages, ...

Many combinatorial optimization problems lend themselves to be modeled as distributed constraint optimization problems (DisCOP). Problems such as job shop scheduling have an intuitive matching between agents and machines. In distributed constraint problems, agents control variables and are connected via constraints. We have equipped these agents with a full constraint solver. This makes it poss...

background : occupational stress is a psychosocial dimension of occupational health concept on social determinants of health, especially, job & environmental condition. recently, staff network of different government universities of thailand have called higher education commission, and ministry of education, thailand to resolve the issue of gov-ernment education policy (e.g. wage inequity, poor...

In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing times means that it is possible to reduce the processing time of the jobs by paying a certain cost. We consider two models of controllable processing times: continuous and discrete. For both models we present polynomial...

In this paper, a combined algorithm consisting of two stages of approaches is proposed for solving a Job Shop Scheduling Problem (JSSP). The first stage of approach called Semi-active Scheduling Approach (SSA) is proposed for obtaining a local optimal solution in a short time by using the improved local search algorithm and the neighborhood search technique proposed in our earlier paper. The se...

We propose a novel framework to solve job shop scheduling problems based on connectionist ideas of distributed information processing. In our approach each operation of a given job shop problem is considered to be a simple agent looking for a position in time such that all its time and resource constraints are satissed. Each agent considers the current time position of its constraint neighbors ...

Job-shop Scheduling Problem (JSP) is one of extremely hard problems because it requires very large combinatorial search space and the precedence constraint between machines. The traditional algorithm used to solve the problem is the branch-andbound method, which takes considerable computing time when the size of problem is large. W e propose a new method for solving JSP using Genetic Algorithm ...

A clonal selection based memetic algorithm is proposed for solving job shop scheduling problems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exploration and exploitation. In the clonal selection mechanism, clonal selection, hypermutation and receptor edit theories are presented to construct an evolutionary searching mechan...

In this paper, we present a hybrid method combining Tabu Search (TS) optimization algorithm with the Very Fast Simulated Annealing (VFSA) procedure for the Job-shop Scheduling Problem (JSP). Tabu search algorithms are among the most effective approaches for solving the job shop scheduling problem which is one of the most difficult NP-complete problems. However, neighborhood structures and move ...