Buscar
Mostrando ítems 1-10 de 190
The Non-Permutation Flow-Shop scheduling problem: A literature review
(Pergamon-Elsevier Science Ltd, 2018-06)
The Non-Permutation Flow-Shop scheduling problem (NPFS) is a generalization of the traditional Permutation Flow-Shop scheduling problem (PFS) that allows changes in the job order on different machines. The flexibility that ...
Golden Ball Algorithm for solving Flow Shop Scheduling Problem
The Flow Shop Scheduling Problem (FSSP) is notoriously NP-hard combinatorial optimization problem. The goal is to find a schedule that minimizes the makespan. This paper proposes an adaptation of a new approach called ...
The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
(Elsevier B.V.PE, 2021)
The best performing approximate methods proposed for the permutational flow shop scheduling problem with makespan minimization are the well known NEH constructive heuristic and the iterated greedy algorithm. Both methods ...
Reducing mean flow time in permutation flow shop
(PALGRAVE MACMILLAN LTD, 2008)
This paper deals with the traditional permutation flow shop scheduling problem with the objective of minimizing mean flowtime, therefore reducing in-process inventory. A new heuristic method is proposed for the scheduling ...
Heuristic for flow shop sequencing with separated and sequence independent setup times
(Associação Brasileira de Engenharia e Ciências Mecânicas - ABCM, 2011)
This paper deals with the permutation flow shop scheduling problem with separated and sequence-independent machine setup times. A heuristic method with the objective of minimizing the total time to complete the schedule ...
The Dominance Flow Shop Scheduling Problem
(Elsevier, 2018-08)
We introduce a new line of analysis of Flow Shop scheduling problems, for the case of two jobs and assuming that processing times are unknown. The goal is to determine the domination relations between permutation and ...
Flow-shop scheduling problem under uncertainties: Review and trends
(International Journal of Industrial Engineering Computations, 2017-02-08)
Among the different tasks in production logistics, job scheduling is one of the most important at
the operational decision-making level to enable organizations to achieve competiveness.
Scheduling consists in the allocation ...
Solving a flow shop scheduling problem with missing operations in an Industry 4.0 production environment
(Growing Science, 2020-10)
Industry 4.0 is a modern approach that aims at enhancing the connectivity between the different stages of the production process and the requirements of consumers. This paper addresses a relevant problem for both Industry ...
Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling
(2018-04-01)
The number of just-in-time jobs maximization in a permutation flow shop scheduling problem is considered. A mixed integer linear programming model to represent the problem as well as solution approaches based on enumeration ...
A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
(Elsevier Science, 2021-03-30)
In this paper we introduce a novel approach to the combinatorial analysis of flow shop scheduling problems for the case of two jobs, assuming that processing times are unknown. The goal is to determine the dominance ...