Scatter search algorithm for the multiprocessor task job-shop scheduling problem

Fan, Kun; Wang, Meng; Zhai, Yafei; Li, Xinning

doi:10.1016/j.cie.2018.11.006

Cited by 19 publications

(3 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to the complexity of different production systems, workshop scheduling can be divided into single machine scheduling, parallel multi-machine scheduling, flow shop scheduling, flexible flow shop scheduling, etc., 8,9 as shown in Figure 3. Single machine scheduling refers to that the working environment only contains one machine, and the workpiece only needs to be processed by the machine.…”

Section: Literature Reviewmentioning

confidence: 98%

“…Once the judgment result of the current cycle is to execute the current process, the workpiece number of the previous process and, the workpiece number of the current process are updated respectively as equations (6) and 7, so as the related other state variables such as vacancy number of the machine and zone to be processed. Thus, Tp(w) can be updated as equation (8), which denotes the end time of the last process of roller w, while Tc denotes the end time of the task by crane which can be updated as equation (9), where ctime m denotes duration time of the task by crane. And then the judgment cycle starts again.…”

Section: Development Of Intelligent Scheduling Algorithm Under Complementioning

confidence: 99%

See 1 more Smart Citation

The study of intelligent scheduling algorithm oriented to complex constraints and multi-process roller grinding workshop

Wang

Jiang³

et al. 2014

Advances in Mechanical Engineering

View full text Add to dashboard Cite

Roller grinding workshop is a typical multi-unit and multi-task manufacturing scenario, which is aimed to repair the surface damage of the rollers caused by the rolling process, so that the rollers can be reused. Due to the process complexity of roller grinding workshop and the large volume and weight of the roller, hoisting and transportation mode with multiple cranes is required. Consequently, the scheduling of the roller grinding workshop needs to consider both the task sequencing in time and the noninterference of the multi-crane trajectory in space. In this paper, the intelligent scheduling of roller grinding workshop is studied based on the characteristics of complex tasks and space-time coupling constraints. Firstly, the scheduling basis is established based on priority rules and process constraints. In order to solve the scheduling problem under the space-time coupling constraints, the position coordinate system is established, and then the algorithms of crane position tracking and cooperative motion without interference are developed. Further, considering the transportation time of crane and its out of sync time point with the processes, the intelligent decision and scheduling algorithm are developed based on the dynamic priority strategy defined to realize scheduling, including time decision, crane decision, and process decision. With the developed intelligent scheduling algorithm applied, the simulation of the roller grinding workshop is conducted under three combinations of priority strategy and noninterference strategy to verify algorithm performance. Under the guarantee of crane noninterference during the full production, the efficiency is improved by 22.1% compared with the existing processing mode of industry. Additionally, EPTR (effective process time rate) based on dynamic priority strategy and noninterference strategy B is up to 100% to avoid intervals between two processes in the scheduling. The dynamic priority developed in this paper reveals more efficiency than MOR principle, while with the strategy B the CUR (crane utilization rate) can be improved more than 20% under the condition of enough machines which facilitates to obtain shorter makespan than strategy A. The intelligent scheduling algorithm developed guarantees the effectiveness and rationality of scheduling with multi-unit and multi-task under the complex constraints. Finally, in order to realize the automatic and intelligent operation of the roller grinding workshop, the management software of the roller grinding workshop is developed by integrating the intelligent scheduling algorithm, which realizes the intelligent production, monitoring, and management of the roller grinding workshop during the full production cycle.

show abstract

Section: Literature Reviewmentioning

confidence: 98%

Section: Development Of Intelligent Scheduling Algorithm Under Complementioning

confidence: 99%

The study of intelligent scheduling algorithm oriented to complex constraints and multi-process roller grinding workshop

Wang

Jiang³

et al. 2014

Advances in Mechanical Engineering

View full text Add to dashboard Cite

show abstract

“…In the GA, he creates new solutions by applying crossover and mutation to two randomly selected solutions from the population. The SSA approach was used for scheduling problems (Fan, Wang, Zhai, & Li, 2019;Riahi, Khorramizadeh, Hakim Newton, & Sattar, 2017), for the uncapacitated facility location problem Hakli and Ortacay (2019), for the economic lot sizing problem (Khojaste Sarakhsi, Fatemi Ghomi, & Karimi, 2016) and for the multiobjective clustering problem (Caballero et al, 2011)). SSA can basically be defined with 5 basic components (Martí, Laguna, & Glover, 2006).…”

Section: Scatter Search Algorithmmentioning

confidence: 99%

A Scatter Search Algorithm for Multi-Criteria Inventory Classification considering Multi-Objective Optimization

Saraçoğlu

2022

Soft Comput

View full text Add to dashboard Cite

Inventory management requires thousands or millions of individual transactions each year. Classification of the items influences the results of inventory management. Traditionally, this is usually classified with considering an annual dollar usage criterion but maybe other criterias such as lead time, criticality, perishability, inventory cost, and demand type can be affected on that classification. The objective of this study is to determine the multi-criteria inventory classification (MCIC) of the inventory items to minimize the total inventory cost and also dissimilarity of classes. Because of the two objectives is considered to solve with together, the maximization of satisfaction level is described to solve the multi-objective problem. This study introduces a Mixed Integer Nonlinear Programming (MINLP) model of the MCIC problem by giving two objectives. A Scatter Search Algorithm (SSA) is used to solve the MINLP model for obtaining high-quality solutions within reasonable computation times. Finally, we illustrate an example and compare our results with other studies in previous literature.

show abstract

Selection hyper-heuristics and job shop scheduling problems: How does instance size influence performance?

Garza-Santisteban,

Cruz-Duarte,

Amaya

et al. 2024

J Sched

View full text Add to dashboard Cite

Scatter search algorithm for the multiprocessor task job-shop scheduling problem

Cited by 19 publications

References 22 publications

The study of intelligent scheduling algorithm oriented to complex constraints and multi-process roller grinding workshop

The study of intelligent scheduling algorithm oriented to complex constraints and multi-process roller grinding workshop

A Scatter Search Algorithm for Multi-Criteria Inventory Classification considering Multi-Objective Optimization

Selection hyper-heuristics and job shop scheduling problems: How does instance size influence performance?

Contact Info

Product

Resources

About