Applications of constraint programming in production scheduling problems: A descriptive bibliometric analysis

被引：6

作者：

Prata, Bruno A. ^{[1
]}

Abreu, Levi R. ^{[1
]}

Nagano, Marcelo S. ^{[2
]}

机构：

[1] Univ Fed Ceara, Dept Ind Engn, Fortaleza, Brazil

[2] Univ Sao Paulo, Dept Prod Engn, Sao Carlos, Brazil

来源：

RESULTS IN CONTROL AND OPTIMIZATION | 2024年 / 14卷

关键词：

Production scheduling; Artificial intelligence; Constraint programming; Methodi ordinatio; Bibliometrix; WEIGHTED COMPLETION-TIME; DEPENDENT SETUP TIMES; SINGLE-MACHINE; JOB-SHOPS; GENETIC ALGORITHM; HYBRID METHOD; BATCH; SEARCH; MODELS; OPTIMIZATION;

D O I：

10.1016/j.rico.2023.100350

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Production scheduling is a class of widely studied combinatorial optimization problems. Given the complexity of the most addressed production environments several solution procedures have been proposed. In recent years, operational researcher practitioners have been paying attention to solving production scheduling problems using constraint programming, and growing interest in this research domain has been evidenced. The aim of this study is to report a descriptive bibliometric analysis of applications of constraint programming in production scheduling problems. The scope of the study is limited to reviewing 170 scientific papers published between 1992 and 2023 from the Scopus and Web of Science databases. In our proposed research questions, we could address the main topics studied, the most studied performance measures, and the profile of the analyzed documents. Furthermore, we could identify the main gaps and present suggestions for future research.

引用

页数：17

共 149 条

[1]

Abreu L.R., 2021, Eng. Optim., P1

[2] A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization [J].