Redirigiendo al acceso original de articulo en 23 segundos...
Inicio  /  Algorithms  /  Vol: 15 Par: 11 (2022)  /  Artículo
ARTÍCULO
TITULO

Taxonomy of Scheduling Problems with Learning and Deterioration Effects

Yenny Alexandra Paredes-Astudillo    
Jairo R. Montoya-Torres and Valérie Botta-Genoulaz    

Resumen

In traditional scheduling problems, job processing times are considered constant and known in advance. This assumption is, however, a simplification when it comes to hand-intensive real-life production contexts because workers usually induce variability in the job processing times due to several factors such as learning, monotony, fatigue, psychological factors, etc. These effects can decrease or increase the actual processing time when workers execute a job. The academic literature has reported several modeling and resolution approaches to deal with the phenomenon in a variety of configurations. However, there is no comprehensive review of these research outputs to the best of our knowledge. In this paper, we follow a systematic approach to review relevant contributions addressing the scheduling problem with learning and deterioration effects. Modeling approaches for learning and deterioration effects, objective functions, and solution methods employed in the literature are the main topics for the taxonomy proposed in this review. A total of 455 papers from 1999 to 2021 are included and analyzed. Different areas of interest are presented, and some opportunities for future research are identified.

 Artículos similares

       
 
Kasper Gaj Nielsen, Inkyung Sung, Mohamed El Yafrani, Deniz Kenan Kiliç and Peter Nielsen    
In this study, we tackle a key scheduling problem in a robotic arm-based food processing system, where multiple conveyors?an infeed conveyor that feeds food items to robotic arms and two tray lane conveyors, on which trays to batch food items are placed?... ver más
Revista: Algorithms

 
Manli Dai and Zhongyi Jiang    
An improved slime mold algorithm (IMSMA) is presented in this paper for a multiprocessor multitask fair scheduling problem, which aims to reduce the average processing time. An initial population strategy based on Bernoulli mapping reverse learning is pr... ver más
Revista: Algorithms

 
Lei Sun, Weimin Shi, Junru Wang, Huimin Mao, Jiajia Tu and Luojun Wang    
Production scheduling in a knitting workshop is an important method to improve production efficiency, reduce costs and improve service. In order to achieve a reasonable allocation of parallel machines as well as cooperation between different machines wit... ver más
Revista: Applied Sciences

 
Che Han Lim and Seung Ki Moon    
In a flexible job shop problem with transportation (FJSPT), a typical flexible manufacturing system comprises transporters that pick up and deliver jobs for processing at flexible job shops. This problem has grown in importance through the wide use of au... ver más
Revista: Applied Sciences

 
Prathamesh Lahande, Parag Kaveri and Jatinderkumar Saini    
Cloud computing delivers robust computational services by processing tasks on its virtual machines (VMs) using resource-scheduling algorithms. The cloud?s existing algorithms provide limited results due to inappropriate resource scheduling. Additionally,... ver más
Revista: Informatics