Flexible job shop scheduling problem with non-linear routes, energy awareness and position-based learning effect (2025)
- Authors:
- USP affiliated authors: RONCONI, DEBORA PRETTI - EP ; BIRGIN, ERNESTO JULIAN GOLDBERG - IME ; MERINO, JOSÉ ANGEL RIVEAUX - IME
- Unidades: EP; IME
- Subjects: ALGORITMOS DE SCHEDULING; CONSUMO DE ENERGIA ELÉTRICA; PROGRAMAÇÃO LINEAR
- Keywords: Escalonamento flexível
- Language: Inglês
- Objetivos de Desenvolvimento Sustentável (ODS):
09. Indústria, inovação e infraestrutura
12. Consumo e produção responsáveis
- Abstract: The flexible job shop scheduling problem is notable for its many practical applications, such as in the on-demand printing industry, glass industry, steel production planning, and automotive repair shops. Additionally, sustainability has become one of the main objectives across all human activities, particularly in production environments. This work we consider the flexible job shop scheduling problem with the objective of minimizing energy consumption. As it is known that a considerable part of the energy consumption occurs when the machines are on and idle, the addressed problem includes the possibility of turning the machines off and on between processing operations. To bring the problem closer to the large variety of real-world problems it encompasses, we include two relevant factors: nonlinear routes and position-based learning effect. The treated problem is formally described through a mixed integer linear programming model. We propose constructive heuristics and two types of neighborhood with which we construct local search schemes. The local search strategies both modify solutions by removing and reinserting operations, but in different ways. The first, called SRRN (Single-Operation Removal and Reinsertion Neighborhood), removes and reinserts a single operation in a position that avoids forming cycles. The second, called SRDRRN (Single-Operation Removal, Destruction, Reinsertion, and Reconstruction Neighborhood), removes an operation along with its successors. If it is reinserted elsewhere, the new position’s operation and its successors are also removed. The resulting partial solution is then rebuilt using the proposed constructive heuristic. In addition, three meta-heuristics – namely, variable neighborhood search, greedy adaptive search procedure, and simulated annealing – have been tailored for the problem at hand.We conduct a large number of experiments to evaluate the performance of the introduced methods, on small-sized and large-sized instances. In the large-sized instances, the general variable neighborhood search, that combines the two neighborhoods into a single method, is particularly effective. In the small-sized instances with known optimal solution, the greedy randomized adaptive search procedure finds solutions that, on average, are within 0.22% of the optimal solution. The instances evaluated in this work are all available at https://www.ime.usp.br/~egbirgin/ for future comparisons.
- Imprenta:
- Publisher place: Rio de Janeiro
- Date published: 2025
- Source:
- Título: Proceedings
- Conference titles: Ibero-Latin American Congress on Computational Methods in Engineering CILAMCE 20257730
-
ABNT
RONCONI, Débora Pretti e BIRGIN, Ernesto Julian Goldberg e RIVEAUX, José Angel. Flexible job shop scheduling problem with non-linear routes, energy awareness and position-based learning effect. 2025, Anais.. Rio de Janeiro: Escola Politécnica, Universidade de São Paulo, 2025. Disponível em: https://publicacoes.softaliza.com.br/cilamce2025/article/view/13541/9281. Acesso em: 02 mar. 2026. -
APA
Ronconi, D. P., Birgin, E. J. G., & Riveaux, J. A. (2025). Flexible job shop scheduling problem with non-linear routes, energy awareness and position-based learning effect. In Proceedings. Rio de Janeiro: Escola Politécnica, Universidade de São Paulo. Recuperado de https://publicacoes.softaliza.com.br/cilamce2025/article/view/13541/9281 -
NLM
Ronconi DP, Birgin EJG, Riveaux JA. Flexible job shop scheduling problem with non-linear routes, energy awareness and position-based learning effect [Internet]. Proceedings. 2025 ;[citado 2026 mar. 02 ] Available from: https://publicacoes.softaliza.com.br/cilamce2025/article/view/13541/9281 -
Vancouver
Ronconi DP, Birgin EJG, Riveaux JA. Flexible job shop scheduling problem with non-linear routes, energy awareness and position-based learning effect [Internet]. Proceedings. 2025 ;[citado 2026 mar. 02 ] Available from: https://publicacoes.softaliza.com.br/cilamce2025/article/view/13541/9281 - Energy-aware flexible job shop scheduling problem with nonlinear routes and position-based learning effect
- Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness
- Heuristic methods for the single machine scheduling problem with different ready times and a common due date
- Metaheuristics for the online printing shop scheduling problem
- Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem
- Um algoritmo do tipo list scheduling para o problema flowshop minimizando o adiantamento e atraso das tarefas
- MIP models for two-dimensional non-guillotine cutting problems with usable leftovers
- Metaheuristics for large-scale instances of the linear ordering problem
- A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers
- A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3283371.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
