Buscar
Mostrando ítems 11-20 de 441
Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions
(Taylor & Francis LtdAbingdonInglaterra, 2006)
Solving scheduling problems in a multi-stage multi-product batch pharmaceutical industry
(AIDIC Servizi, 2010-09)
An iterative two-stage decomposition solution strategy for solving real-world scheduling problems in multi-stage multi-product batch plants is presented. The proposed method has as a core a mixed integer mathematical model, ...
A memetic algorithm for the total tardiness single machine scheduling problem
(Elsevier Science BvAmsterdamHolanda, 2001)
Tardiness minimization in a flexible job shop: A tabu search approach
(Kluwer Academic PublDordrechtHolanda, 2004)
A multi-objective memetic algorithm for the job-shop scheduling problem
(Springer, 2012-04-25)
Planning means, in the realm of production activities, to design, coordinate, manage and control all the operations involved in the production system. Many MOPs (Multi-Objective Optimization Problems) are generated in ...
Dynamic Scheduling in Multiproduct Batch Plants
(Pergamon-Elsevier Science Ltd., 2003-09)
This work introduces a novel MILP formulation for reactive scheduling of multiproduct batch plants to optimally generate updated schedules due to the occurrence of unforeseen events. It can also be used to improve a ...
An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem
(Kluwer Academic PublDordrechtHolanda, 2004)
Aerospace Manufacturing Industry: A Simulation-Based Decision Support Framework for the Scheduling of Complex Hoist Lines
(Lizandra Garcia, Lupi Vergara, 2017-09)
The hoist scheduling problem is a critical issue in the design and control of Automated Manufacturing Systems. To deal with the major complexities appearing in such problem, this work introduces an advanced simulation model ...
Integrated planning and scheduling with due dates in corrugated board boxes industry
(American Chemical Society, 2013-01)
An integrated approach that solves the cutting stock problem and scheduling is considered in this article. The main challenging characteristics of this problem are given by its combinatorial nature, as well as the ...
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 ...