|
|
|
|
|
Christoph Laroque, Madlene Leißau, Pedro Copado, Christin Schumacher, Javier Panadero and Angel A. Juan
Based on a real-world application in the semiconductor industry, this article models and discusses a hybrid flow shop problem with time dependencies and priority constraints. The analyzed problem considers a production where a large number of heterogeneo...
ver más
|
|
|
|
|
|
|
|
|
Christos Valouxis, Christos Gogos, Angelos Dimitsas, Petros Potikas and Anastasios Vittas
Machine scheduling is a hard combinatorial problem having many manifestations in real life. Due to the schedule followed, the possibility of installations of machines operating sub-optimally is high. In this work, we examine the problem of a single machi...
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
|
|
|
|
|
|
|
|
|
Bo Xu, Yi Hu, Menglan Hu, Feng Liu, Kai Peng and Lan Liu
Recent years have witnessed a paradigm shift from centralized cloud computing to decentralized edge computing. As a key enabler technique in edge computing, computation offloading migrates computation-intensive tasks from resource-limited devices to near...
ver más
|
|
|
|
|
|
|
|
|
Milos Seda
The assignment problem is a problem that takes many forms in optimization and graph theory, and by changing some of the constraints or interpreting them differently and adding other constraints, it can be converted to routing, distribution, and schedulin...
ver más
|
|
|
|