|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
BongJoo Jeong, Jun-Hee Han and Ju-Yong Lee
This study considers a scheduling problem for a flow shop with urgent jobs and limited waiting times. The urgent jobs and limited waiting times are major considerations for scheduling in semiconductor manufacturing systems. The objective function is to m...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mehrdad Amirghasemi
This paper presents an effective stochastic algorithm that embeds a large neighborhood decomposition technique into a variable neighborhood search for solving the permutation flow-shop scheduling problem. The algorithm first constructs a permutation as a...
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Christin Schumacher and Peter Buchholz
In modern production systems, scheduling problems have to be solved in consideration of frequently changing demands and varying production parameters. This paper presents a approach combining forecasting and classification techniques to predict uncertain...
ver más
|
|
|
|
|
|
|
|
|
|
|
Alessandro Agnetis, Fabrizio Rossi and Stefano Smriglio
We address some special cases of job shop and flow shop scheduling problems with s-precedence constraints. Unlike the classical setting, in which precedence constraints among the tasks of a job are finish?start, here the task of a job cannot start before...
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
|
|
|
|
|
|
|
|
|
|
|
Damla Kizilay, Mehmet Fatih Tasgetiren, Quan-Ke Pan and Liang Gao
In this paper, we propose a variable block insertion heuristic (VBIH) algorithm to solve the permutation flow shop scheduling problem (PFSP). The VBIH algorithm removes a block of jobs from the current solution. It applies an insertion local search to th...
ver más
|
|
|
|
|
|
|
|
|
|
|
Eliana Marcela Peña Tibaduiza, Edwin Alberto Garavito Hernández, Luis Eduardo Pérez Figueredo, Eslendis Moratto Chimenty
Pág. 46 - 64
AbstractDownloadsReferencesHow to Cite
|
|
|
|
|
|
|
|
|
|
|
Ahmed R. Sadik and Bodo Urban
This research combines between two different manufacturing concepts. On the one hand, flow shop scheduling is a well-known problem in production systems. The problem appears when a group of jobs shares the same processing sequence on two or more machines...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ahmed R. Sadik and Bodo Urban
This research combines between two different manufacturing concepts. On the one hand, flow shop scheduling is a well-known problem in production systems. The problem appears when a group of jobs shares the same processing sequence on two or more machines...
ver más
|
|
|
|
|
|
|
|
|
|
|
Rony Peterson da Rocha, Mauro Antônio Silva Sá Ravagnani, Cid Marcos Gonçalves Andrade, Paulo Roberto Paraíso
Pág. 453 - 461
Current research addresses the Permutation Flow Shop scheduling problem, characterized as Production Scheduling in Batch Process (PSBP) to minimize total time to complete the schedule (Makespan). A method to approach the problem of production scheduling ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Hafewa BARGAOUI,Olfa BELKAHLA DRISS
Pág. 27 - 37
|
|
|
|
|
|