|
|
|
|
|
Xuelian Pang, Haoran Xue, Ming-Lang Tseng, Ming K. Lim and Kaihua Liu
Prior studies are lacking which address permutation flow shop scheduling problems and hybrid flow shop scheduling problems together to help firms find the optimized scheduling strategy. The permutation flow shop scheduling problem and hybrid flow shop sc...
ver más
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Jose M. Framinan and Rainer Leisten
The goal of manufacturing scheduling is to allocate a set of jobs to the machines in the shop so these jobs are processed according to a given criterion (or set of criteria). Such criteria are based on properties of the jobs to be scheduled (e.g., their ...
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Tamer F. Abdelmaguid
An important element in the integration of the fourth industrial revolution is the development of efficient algorithms to deal with dynamic scheduling problems. In dynamic scheduling, jobs can be admitted during the execution of a given schedule, which n...
ver más
|
|
|
|
|
|
|
|
|
|
|
Wei Han, Fang Guo and Xichao Su
The scheduling problems in mass production, manufacturing, assembly, synthesis, and transportation, as well as internet services, can partly be attributed to a hybrid flow-shop scheduling problem (HFSP). To solve the problem, a reinforcement learning (RL...
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
|
|
|
|
|
|
|
|
|
|
|
Levente Fazekas, Boldizsár Tüu-Szabó, László T. Kóczy, Olivér Hornyák and Károly Nehéz
Flow-shop scheduling problems are classic examples of multi-resource and multi-operation scheduling problems where the objective is to minimize the makespan. Because of the high complexity and intractability of the problem, apart from some exceptional ca...
ver más
|
|
|
|
|
|
|
|
|
|
|
Toufik Mzili, Ilyass Mzili, Mohammed Essaid Riffi and Gaurav Dhiman
This paper presents a new hybrid algorithm that combines genetic algorithms (GAs) and the optimizing spotted hyena algorithm (SHOA) to solve the production shop scheduling problem. The proposed GA-SHOA algorithm incorporates genetic operators, such as un...
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Amin Rahimi, Seyed Mojtaba Hejazi, Mostafa Zandieh and Mirpouya Mirmozaffari
In this paper, the problem of finding an assignment of ?n? surgeries to be presented in one of ?m? identical operating rooms (ORs) or machines as the surgical case scheduling problem (SCSP) is proposed. Since ORs are among NP-hard optimization problems, ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jian Li, Huankun Li, Pengbo He, Liping Xu, Kui He and Shanhui Liu
Green manufacturing has become a new production mode for the development and operation of modern and future manufacturing industries. The flexible job shop scheduling problem (FJSP), as one of the key core problems in the field of green manufacturing pro...
ver más
|
|
|
|
|
|
|
|
|
|
|
Chang-Bae Gil and Jee-Hyong Lee
Manufacturing sites encounter various scheduling problems, which must be dealt with to efficiently manufacture products and reduce costs. With the development of smart factory technology, many elements at manufacturing sites have become unmanned and more...
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Eliana Maria Gonzalez-Neira, Jairo R. Montoya-Torres and Jose-Fernando Jimenez
This paper proposes a hybridized simheuristic approach that couples a greedy randomized adaptive search procedure (GRASP), a Monte Carlo simulation, a Pareto archived evolution strategy (PAES), and an analytic hierarchy process (AHP), in order to solve a...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mingming Xu, Shuning Zhang and Guanlong Deng
When no-wait constraint holds in job shops, a job has to be processed with no waiting time from the first to the last operation, and the start time of a job is greatly restricted. Using key elements of the iterated greedy algorithm, this paper proposes a...
ver más
|
|
|
|
|
|