|
|
|
|
|
Marko Ðurasevic, Domagoj Jakobovic, Stjepan Picek and Luca Mariot
The automated design of dispatching rules (DRs) with genetic programming (GP) has become an important research direction in recent years. One of the most important decisions in applying GP to generate DRs is determining the features of the scheduling pro...
ver más
|
|
|
|
|
|
|
|
|
|
|
Alexandru-Liviu Olteanu, Marc Sevaux and Mohsen Ziaee
In this paper, an unrelated parallel machine scheduling problem with job (product) and machine acceptance and renewable resource constraints was considered. The main idea of this research was to establish a production facility without (or with minimum) i...
ver más
|
|
|
|
|
|
|
|
|
|
|
Everton Tozzo, Syntia Lemos Cotrim, Edwin Vladimir Cardoza Galdamez, Gislaine Camila Lapasini Leal
Pág. e36607
This paper presents the evaluation of two metaheuristics to solve the Unrelated Parallel Machine Scheduling Problem with Sequence Machine Dependent Setup Time. Considering such a problem, there is no relation between the time to process each task and the...
ver más
|
|
|
|
|
|
|
|
|
|
|
Edyta Kucharska
The aim of the paper is to present a heuristic method for decision-making regarding an NP-hard scheduling problem with limitations related to tasks and the resources dependent on the current state of the process. The presented approach is based on the al...
ver más
|
|
|
|
|
|
|
|
|
|
|
Felipe Tomás Muñoz Valdés, Reinaldo Javier Moraga Suazo
Este artículo presenta una heurística constructiva visionaria para resolver el problema de máquinas paralelas no relacionadas con tiempos de setup dependientes de la secuencia, donde el objetivo es minimizar el tiempo de completación del último trabajo, ...
ver más
|
|
|
|
|
|