In a shop floor of the industry, the routings which are based upon the jobs that need to be processed on different machines are one among the major activities and therefore the resource requirements are not based upon the quantity as in a flow shop but rather the routings for the products being produced. However, both job shop and flow shop production cope with a scheduling problem to find a fe...

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...

This paper provides an application oriented analysis of local search procedures for Operation Scheduling and Shop Floor Management of a major German manufacturer of cigarette machines. The heuristics applied are the Thresholdand Simulated Annealing-Algorithm considering Job Shop as well as embedded FMS production features. In this context a new neighbourhood search technique is developed, which...