In a production environment, scheduling decides job and machine allocations the operation sequence. shop system, wide variety of jobs, complex routes, real-life events becomes challenging for activities. New, unexpected disrupt schedule require dynamic updates to on an event-based basis. To solve problem, we propose multi-agent system with reinforcement learning aimed at minimization tardiness ...

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

In the paper we discuss the influence of the route flexibility degree, the open rate of operations and the production type coefficient on makespan. The flexible job-open shop scheduling problem FJOSP (an extension of the classical job shop scheduling) is analyzed. For the analysis of the production process we used a hybrid heuristic of the GRASP (greedy randomized adaptive search procedure) wit...

The job shop scheduling is an important and complex problem for a manufacturing system. It is well known and popular problem having (Non-Polynomial) NP-hard characteristic to find the optimal or near optimal solution (schedules) quickly. In job shop scheduling a set of “N” number of jobs are processed through an “M” number of given set of machines. It must be processed in the prescribed order b...