The cyclic job-shop scheduling problem: The new subclass of the job-shop problem and applying the Simulated annealing to solve it
In the paper, the new approach to the scheduling problem are described. The approach deals with the problem of planning the cyclic production and proposes to consider such scheduling problem as the cyclic job-shop problem of the order k, where k is the number of reiterations. It was found out that planning of only one iteration of the loop is less effective than planning of the entire cycle. To the experimental research, a number of test instances of the job-shop scheduling problem by Operation Research Library were used. The Simulated Annealing was applied to solve the instances. The experiments proved that the approach proposed allows increasing the efficiency of cyclic scheduling significantly.
Code (0)
등록된 구현이 없습니다.
Tasks
Job Shop SchedulingSchedulingSimilar Papers 제목 키워드 기반
Recurrent neural network approach for cyclic job shop scheduling problem
While cyclic scheduling is involved in numerous real-world applications, solving the derived problem is still of exponential complexity. This paper focuses specifically on modelling the manufacturing application as a cyc…
Efficient Neural NetworkJob Shop SchedulingSchedulingA Novel Metaheuristics To Solve Mixed Shop Scheduling Problems
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…
SchedulingA Hybrid Bacterial Foraging Algorithm For Solving Job Shop Scheduling Problems
Bio-Inspired computing is the subset of Nature-Inspired computing. Job Shop Scheduling Problem is categorized under popular scheduling problems. In this research work, Bacterial Foraging Optimization was hybridized with …
Job Shop SchedulingSchedulingJob Shop Scheduling Benchmark: Environments and Instances for Learning and Non-learning Methods
We introduce an open-source GitHub repository containing comprehensive benchmarks for a wide range of machine scheduling problems, including Job Shop Scheduling (JSP), Flow Shop Scheduling (FSP), Flexible Job Shop Schedu…
Job Shop SchedulingSchedulingMetaheuristics for the Online Printing Shop Scheduling Problem
In this work, the online printing shop scheduling problem introduced in (Lunardi et al., Mixed Integer Linear Programming and Constraint Programming Models for the Online Printing Shop Scheduling Problem, Computers & Ope…
Job Shop SchedulingScheduling