|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|