|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Shubhendu Kshitij Fuladi and Chang-Soo Kim
In the real world of manufacturing systems, production planning is crucial for organizing and optimizing various manufacturing process components. The objective of this paper is to present a methodology for both static scheduling and dynamic scheduling. ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Hee Jun Ryu, Ye Na Jo, Won Jun Lee, Ji Won Cheong, Boo Yong Moon and Young Dae Ko
The efficient management of social worker personnel is important since it involves a huge portion in its operations. However, the burnout and turnover rates of social workers are very high, which is due to dissatisfaction with the irregular and unequal s...
ver más
|
|
|
|
|
|
|
|
|
|
|
Pavel V. Matrenin
Planning tasks are important in construction, manufacturing, logistics, and education. At the same time, scheduling problems belong to the class of NP-hard optimization problems. Ant colony algorithm optimization is one of the most common swarm intellige...
ver más
|
|
|
|
|
|
|
|
|
|
|
Meghana Thiyyakat, Subramaniam Kalambur and Dinkar Sitaram
The use of data centers is ubiquitous, as they support multiple technologies across domains for storing, processing, and disseminating data. IoT applications utilize both cloud data centers and edge data centers based on the nature of the workload. Due t...
ver más
|
|
|
|
|
|
|
|
|
|
|
Giuseppe Di Modica and Orazio Tomarchio
In the past twenty years, we have witnessed an unprecedented production of data worldwide that has generated a growing demand for computing resources and has stimulated the design of computing paradigms and software tools to efficiently and quickly obtai...
ver más
|
|
|
|
|
|
|
|
|
|
|
Athanasios C. Spanos, Sotiris P. Gayialis, Evripidis P. Kechagias and Georgios A. Papadopoulos
In this research, we present a hybrid algorithmic framework and its integration into the precise production scheduling system of a Greek metal forming factory. The system was created as a decision support tool to assist production planners in arranging w...
ver más
|
|
|
|
|
|
|
|
|
|
|
Atabak Elmi, Dhananjay R. Thiruvady and Andreas T. Ernst
Cyclic scheduling is of vital importance in a repetitive discrete manufacturing environment. We investigate scheduling in the context of general cyclic job shops with blocking where there are no intermediate buffers between the machines. We also consider...
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
|
|
|
|
|
|
|
|
|
|
|
Danial Rooyani and Fantahun Defersha
The work in this paper is motivated by a recently published article in which the authors developed an efficient two-stage genetic algorithm for a comprehensive model of a flexible job-shop scheduling problem (FJSP). In this paper, we extend the applicati...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jiri Stastny, Vladislav Skorpil, Zoltan Balogh and Richard Klein
In this paper we introduce the draft of a new graph-based algorithm for optimization of scheduling problems. Our algorithm is based on the Generalized Lifelong Planning A* algorithm, which is usually used for path planning for mobile robots. It was teste...
ver más
|
|
|
|
|
|
|
|
|
|
|
Bruno Cunha, Ana Madureira, Benjamim Fonseca and João Matos
In this paper, we present and discuss an innovative approach to solve Job Shop scheduling problems based on machine learning techniques. Traditionally, when choosing how to solve Job Shop scheduling problems, there are two main options: either use an eff...
ver más
|
|
|
|
|
|
|
|
|
|
|
JunWeon Yoon, TaeYoung Hong, ChanYeol Park, Seo-Young Noh and HeonChang Yu
High-performance computing (HPC) uses many distributed computing resources to solve large computational science problems through parallel computation. Such an approach can reduce overall job execution time and increase the capacity of solving large-scale...
ver más
|
|
|
|
|
|
|
|
|
|
|
Piotr Jedrzejowicz and Izabela Wierzbowska
One of the possible approaches to solving difficult optimization problems is applying population-based metaheuristics. Among such metaheuristics, there is a special class where searching for the best solution is based on the collective behavior of decent...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yuri N. Sotskov, Natalja M. Matsveichuk and Vadzim D. Hatsura
We study two-machine shop-scheduling problems provided that lower and upper bounds on durations of n jobs are given before scheduling. An exact value of the job duration remains unknown until completing the job. The objective is to minimize the makespan ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Hongchan Li, Haodong Zhu and Tianhua Jiang
In recent decades, workshop scheduling has excessively focused on time-related indicators, while ignoring environmental metrics. With the advent of sustainable manufacturing, the energy-aware scheduling problem has been attracting more and more attention...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xiaolin Gu, Ming Huang and Xu Liang
For solving the complex flexible job-shop scheduling problem, an improved genetic algorithm with adaptive variable neighborhood search (IGA-AVNS) is proposed. The improved genetic algorithm first uses a hybrid method combining operation sequence (OS) ran...
ver más
|
|
|
|
|
|
|
|
|
|
|
Julia Lange and Frank Werner
The job shop scheduling problem with blocking constraints and total tardiness minimization represents a challenging combinatorial optimization problem of high relevance in production planning and logistics. Since general-purpose solution approaches strug...
ver más
|
|
|
|
|
|
|
|
|
|
|
Atif Shahzad and Nasser Mebarki
A promising approach for an effective shop scheduling that synergizes the benefits of the combinatorial optimization, supervised learning and discrete-event simulation is presented. Though dispatching rules are in widely used by shop scheduling practitio...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sebastiano Gaiardelli, Damiano Carra, Stefano Spellini and Franco Fummi
Efficiently managing resource utilization is critical in manufacturing systems to optimize production efficiency, especially in dynamic environments where jobs continually enter the system and machine breakdowns are potential occurrences. In fully automa...
ver más
|
|
|
|
|
|