Buscar
Mostrando ítems 1-10 de 365
GRASP Algorithm to Minimize Makespan in a No-Wait Flow Shop with Batch Processing Machines
(Inst of Industrial Engineers; Cdr edition, 2012-05-19)
Given a set of jobs and two Batch Processing Machines (BPMs) in a flow shop environment
On minimizing the makespan when some jobs cannot be assigned on the same machine
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
We study the classical scheduling problem of assigning jobs to machines in order to minimize
the makespan. It is well-studied and admits an EPTAS on identical machines and a (2 − 1/m)-
approximation algorithm on unrelated ...
On the extension complexity of scheduling
(Elsevier, 2020)
We study the minimum makespan problem on identical machines in which we want to assign a set of n given jobs to m machines in order to minimize the maximum load over the machines. We prove upper and lower bounds for the ...
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 ...
Formulaci?n de heur?stica para minimizar el makespan en el problema de scheduling job-shop flexible
(Universidad de Ibagu?Facultad de Ingenier?a, 2019)
PSO for Minimizing Makespan of Non-Identical Parallel Batch Processing Machines
(Institute of Industrial Engineers ( IIE ), 2011-05-25)
Environmental Stress Screening (ESS) chambers are commonly used to test Printed Circuit Boards (PCBs) to detect early failures before they are used in the field. This research is motivated by our interactions with an ...
APPLYING AN ADAPTIVE PETRI NET TO CALCULATE THE MAKESPAN IN THE JOB SHOP SCHEDULING PROBLEM
(2014)
The Job Shop Scheduling Problem (JSSP) is one of the
typical problems that engineers face on designing
Flexible Manufacturing Systems (FMS). In this
problem, it is important to find the optimal scheduling
to perform a set ...
Minimizing Makespan in a No-Wait Flow Shop With Batch Processing Machines
(Institute of Industrial Engineers ( IIE ), 2011-05-25)
Given a set of jobs and two batch processing machines (BPMs) arranged in a flow shop environment
Selective methodology of population dynamics for optimizing a multiobjective environment of job shop productionMetodología selectiva de dinámica poblacional para optimizar un ambiente multiobjetivo de producción job shop
(2015-03-18)
This paper develops a methodology based on population genetics to improve the performance of two or more variables in job shop production systems. The methodology applies a genetic algorithm with special features in the ...