Multi-objective Iterated Local Search based on decomposition for job scheduling problems with machine deterioration effect

Santos, Vívian Ludimila Aguiar; Carvalho, Thales Francisco Mota; Assis, Luciana Pereira de; Cohen, Miri Weiss; Guimarães, Frederico Gadelha

doi:10.1016/j.engappai.2022.104826

Cited by 13 publications

(3 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Solving real-world high-dimensional production scheduling problems are computationally expensive and rarely used as benchmarks to test algorithms. A few studies applied these state-ofart multi-objective algorithms to solve scheduling problems [46][47][48][49][50][51] . In Annex A, the algorithms are briefly described.…”

Section: Subject Tomentioning

confidence: 99%

Modeling and optimization of bakery production scheduling to minimize makespan and oven idle time

Babor

Emire

Kohlus

et al. 2023

Sci Rep

View full text Add to dashboard Cite

Makespan dominates the manufacturing expenses in bakery production. The high energy consumption of ovens also has a substantial impact, which bakers may overlook. Bakers leave ovens running until the final product is baked, allowing them to consume energy even when not in use. It results in energy waste, increased manufacturing costs, and CO2 emissions. This paper investigates three manufacturing lines from small and medium-sized bakeries to find optimum makespan and ovens’ idle time (OIDT). A hybrid no-wait flow shop scheduling model considering the constraints that are most common in bakeries is proposed. To find optimal solutions, non-dominated sorting genetic algorithm (NSGA-II), strength Pareto evolutionary algorithm (SPEA2), generalized differential evolution (GDE3), improved multi-objective particle swarm optimization (OMOPSO), and speed-constrained multi-objective particle swarm optimization (SMPSO) were used. The experimental results show that the shortest makespan does not always imply the lowest OIDT. Even the optimized solutions have up to 231 min of excess OIDT, while the makespan is the shortest. Pareto solutions provide promising trade-offs between makespan and OIDT, with the best-case scenario reducing OIDT by 1348 min while increasing makespan only by 61 min from the minimum possible makespan. NSGA-II outperforms all other algorithms in obtaining a high number of good-quality solutions and a small number of poor-quality solutions, followed by SPEA2 and GDE3. In contrast, OMOPSO and SMPSO deliver the worst solutions, which become pronounced as the problem complexity grows.

show abstract

Section: Subject Tomentioning

confidence: 99%

Modeling and optimization of bakery production scheduling to minimize makespan and oven idle time

Babor

Emire

Kohlus

et al. 2023

Sci Rep

View full text Add to dashboard Cite

show abstract

“…The task of choosing the most appropriate priority sequencing rule for deciding the sequence of job processing at a workstation presents a complex and difficult problem. When considering workstation management, it is important to note that there is no definitive sequencing rule that can be universally regarded as the optimal choice [2,3].…”

Section: Introductionmentioning

confidence: 99%

Optimizing Priority Sequencing Rules in Parallel Machine Scheduling: An Evaluation and Selection Approach using Hybrid MCDM Techniques

Badi,

Bouraima,

Qiu

et al. 2024

Decis. Mak. Adv.

View full text Add to dashboard Cite

Priority sequencing criteria are of utmost importance in the determination of the sequence in which jobs are processed at workstations in parallel machine scheduling. The utilization of diverse priority rules can result in varied sequencing arrangements, hence requiring more experimentation to ascertain the optimal rule. Hence, it is imperative to formulate a thorough approach for the selection of the most suitable priority sequencing rule from the standpoint of management decision-making. The objective of this research is to analyze and compare six different priority sequencing rules in the context of parallel machine scheduling. Additionally, a methodology is proposed for the assessment and selection of the most suitable rule. This methodology combines the full consistency method (FUCOM) with the measurement of alternatives and ranking according to compromise solution (MARCOS) method, which are both multi-criteria decision-making techniques. When reviewing and selecting the optimal priority sequencing rule, seven parameters are taken into consideration. The weights of these criteria are computed using the FUCOM method, while the relative proximity values of all priority sequencing rules are derived by the MARCOS method. The data indicate that the priority sequencing rules are prioritized according to their level of importance. The approach outlined in this study is essential for workstation management to make well-informed decisions regarding the choice of the most advantageous priority sequencing rule for parallel machine scheduling.

show abstract

“…Regarding the second development, an algorithm that improves the protocol's performance defined in NGSA-II is structured [39]. Regarding the third one, an algorithm that minimizes both the processing time and the deterioration of the machines according to their utilization level in real time is defined [40].…”

Section: Introductionmentioning

confidence: 99%

Occupational hazards and economic indicators in the scheduling of a make-to-order system

Coca-Ortegón

2023

DYNA

View full text Add to dashboard Cite

Este artículo examina algunos peligros ocupacionales específicos y ciertos indicadores económicos de sostenibilidad en un sistema de manufactura por pedido. Al respecto, se estructuran dos métodos multiobjetivo. El primero es un algoritmo genético rediseñado; el segundo está basado en sumas normalizadas. La comparación establece que el primero supera al segundo en 528%, en lo concerniente al indicador “C-Metric”.

show abstract

Multi-objective Iterated Local Search based on decomposition for job scheduling problems with machine deterioration effect

Cited by 13 publications

References 36 publications

Modeling and optimization of bakery production scheduling to minimize makespan and oven idle time

Modeling and optimization of bakery production scheduling to minimize makespan and oven idle time

Optimizing Priority Sequencing Rules in Parallel Machine Scheduling: An Evaluation and Selection Approach using Hybrid MCDM Techniques

Occupational hazards and economic indicators in the scheduling of a make-to-order system

Contact Info

Product

Resources

About