Job - Shop Scheduling by Simulated Annealing Combined with Deterministic Local Search
نویسندگان
چکیده
The Job-Shop Scheduling Problem (JSSP) is one of the most difficult NP-hard combinatorial optimization problems. This paper proposes a new method for solving JSSPs based on simulated annealing (SA), a stochastic local search, enhanced by shifting bottleneck (SB), a problem specific deterministic local search. In our method new schedules are generated by a variant of Giffler and Thompson’s active scheduler with operation permutations on the critical path. SA selects a new schedule and probabilistically accepts or rejects it. The modified SB is applied to repair the rejected schedule; the new schedule is accepted if an improvement is made. Experimental results showed the proposed method found near optimal schedules for the difficult benchmark problems and outperformed other existing local search algorithms.
منابع مشابه
Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems
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...
متن کاملProduction Control of a Flexible Manufacturing System in a Job Shop Environment
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...
متن کاملA Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations
In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...
متن کاملIdentifying and exploiting commonalities for the job-shop scheduling problem
For many combinatorial problems the solution landscape is such that nearoptimal solutions share common characteristics: the so-called commonalities or building blocks. We propose a method to identify and exploit these commonalities, which is based on applying multistart local search. In the first phase, we apply the local search heuristic, which is based on Simulated Annealing, to perform a set...
متن کاملOn solving the classic job shop makespan problem by minimizing Lmax
In this paper, the classic job shop scheduling problem of minimizing makespan, J//Cmax, is studied. A heuristic approach is presented for solving the J//Lmax problem using an iterative deterministic simulation technique combined with simulated annealing. A simple transformation is provided for converting a J//Cmax problem to an equivalent J//Lmax problem. The approach is tested on some well-kno...
متن کامل