Material handling tasks in the job shops have to be coordinated with manufacturing operations in order to efficiently utilize the production resources and to reduce the accumulation of work-in-process inventory. This paper extends the traditional job shop scheduling problem by incorporating the scheduling of the material handling tasks. It provides a generic definition and a network model for t...

This paper presents a new simulation methodology for scheduling and coordinating decentralized job shops using multi-computer systems. The parallel working subsystems of an integrated production system are distributed across a network of computers. Utilizing the special structure of parallel processor architectures new coordination and scheduling rules for job shops are designed and evaluated. ...

The job-shop scheduling (JSS) is a schedule planning for low volume systems with many variations in requirements. In job-shop scheduling problem (JSSP) environment, there are j jobs to be processed on m machines with a certain objective function to be minimized. JSSP with j jobs to be processed on more than two machines have been classified as a combinatorial problem. They cannot be formulated ...

This paper represents the metaheuristics proposed for solving a class of Shop Scheduling problem. The Bacterial Foraging Optimization algorithm is featured with Ant Colony Optimization algorithm and proposed as a natural inspired computing approach to solve the Mixed Shop Scheduling problem. The Mixed Shop is the combination of Job Shop, Flow Shop and Open Shop scheduling problems. The sample i...

We propose a predictive-reactive approach for the single machine problem. It constructs a set of schedules following a partial order and, every time a decision should be taken, uses the temporal flexibility and the flexibility in job sequencing introduced to provide the decision-maker a set of alternatives, compatible with the modeled constraints.

We present here a discipline for job shop rescheduling based on partial order backtracking. We show that partial order backtracking ooers the rescheduler a framework for schedule repair, based upon a set of nogoods, which impose a systematic partial order on the set of activities to be repaired but allows non systematic techniques to be used within that framework. We present rescheduling as par...