[PDF] Top 20 Intervencin educativa para la prevencin del dao renal en pacientes diabticos
Has 10000 "Intervencin educativa para la prevencin del dao renal en pacientes diabticos" found on our website. Below are the top 20 most common "Intervencin educativa para la prevencin del dao renal en pacientes diabticos".
A Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
... proposed B and B algorithm to minimize the total weighted tardiness is elaborated in this ...the B and B algorithm should be designed are the choice ... See full document
12
Electromagnetism-like algorithm for fuzzy flow shop batch processing machines scheduling to minimize total weighted earliness and tardiness
... covering problem [20], p-hub median problem [15], feature selection [27], single machine scheduling [6], flow shop [14], and job shop [29], and the ... See full document
8
A Mathematical Model of a Multi-Criteria Parallel Machine Scheduling Problem: a Genetic Algorithm (RESEARCH NOTE)
... a scheduling problem for a given set of independent jobs on unrelated parallel machines to minimize the total weighted ...this problem is difficult to solve, a ... See full document
8
Scheduling a maintenance activity under skills constraints to minimize total weighted tardiness and late tasks Pages 135-144 Download PDF
... The problem considered in this paper concerns scheduling of maintenance tasks under resource (maintenance teams) ...This problem is generally known as unrelated parallel machine ... See full document
14
Efficient Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Unrelated Parallel Machines
... to minimize the makespan. Since, this problem is NP-hard, any attempt to obtain the optimal solution through exact algorithm may end with failure for most of the ...single machine ... See full document
47
A hybrid algorithm for unrelated parallel machines scheduling Pages 681-702 Download PDF
... genetic algorithm (GA) and a bottleneck based heuristic (BB) algorithms for solving the problem of minimizing makespan of the jobs in no-wait reentrant flow shop production ...search algorithm was ... See full document
5
Mathematical models for a batch scheduling problem to minimize earliness and tardiness
... to minimize early and tardy completion times of jobs in a BPM scheduling ...and tardiness of orders is crucial in any manufacturing environment including BPM ...the weighted sum of earliness ... See full document
7
A Hybrid Differential Particle Swarm Optimization Approach to Solve a Multi-objective Parallel Machine Scheduling Problem
... the scheduling problems. A lot of research has been made on parallel machines, independent of the machine environment, ...machines, unrelated, etc. In a general PMS problem, a set of n ... See full document
85
Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines
... the problem of scheduling jobs uniform parallel ma- chines to minimize the sum of earliness and tardiness ...or tardiness penalty, which may be different for different ...this ... See full document
8
An imperialist competitive algorithm for a bi-objective parallel machine scheduling problem with load balancing consideration Pages 191-202 Download PDF
... shop scheduling problem with setup times where the objective function was to minimize the total completion ...The problem was solved using an AICA and ...optimization algorithm ... See full document
27
Scheduling Oriented Improvement of Kanban Card Resupplying in Logistic Systems at Automotive Industry
... an algorithm for the design of single-stage adaptive kanban system because he considered that the traditional kanban system with fixed quantity of cards work disappointing in unstable ...the problem of ... See full document
51
GRASP to minimize total weighted tardiness in a permutation flow shop environment Pages 161-176 Download PDF
... PFS problem that minimizes tardiness (Du & Leung, 1990), heuristic and metaheuristic methods have been widely used to solve them, considering that exact methods are impractical for medium and large ... See full document
5
Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines
... approximation algorithm that are both based on sur- rogate relaxation and duality to solve this NP hard prob- ...a weighted aggregate of these ...the problem of scheduling jobs on ... See full document
33
Bounds for the permutation flowshop scheduling problem with exact time lags to minimize the total earliness and tardiness
... the problem of n-jobs scheduling in an m-machine permutation flowshop with exact time lags between consecutive operations of each ...the total tardiness and ...the problem is ... See full document
178
A New Fuzzy Hybrid Dynamic Programming for Scheduling Weighted Jobs on Single Machine
... On analyzing Table 11, it could be figured out that increasing in initial population could most of times make last results better; however, it costs much computational time. In addition, there is a case not only ... See full document
6
Simulated Annealing Algorithm to Minimize Makespanin Single Machine Scheduling Problem withUniform Parallel Machines
... machines scheduling problem, consider the machine shop of an automobile ...to minimize the makespan, this practical reality corresponds to single machine scheduling ... See full document
40
A genetic algorithm for preemptive scheduling of a single machine Pages 607-614 Download PDF
... in scheduling, with earliness and tardiness penalties where the earliness costs was dependent on the start times of the ...one-machine problem where the jobs had distinct due dates, earliness ... See full document
6
Minimizing Makespan for Machine Scheduling and Worker Assignment Problem in Identical Parallel Machine Models Using GA
... For the number of workers and machine assignment the “Recipe Solving Method” of Evolver was used. The “Recipe Solving Method” implements uniform crossover [13]. This means that instead of chopping the list of ... See full document
17
Solving Single Machine Scheduling Problem Using Type-2 Trapezoidal Fuzzy Numbers
... Let F( R ) be the set of all type-2 normal trapezoidal fuzzy numbers. One convenient approach for solving numerical valued problem is based on the concept of comparison of fuzzy numbers by use of ranking function. ... See full document
188
A branch and bound for single machine stochastic scheduling to minimize the maximum lateness Pages 499-510 Download PDF
... date problem by considering the random processing times and solved it by using an o (n log n) ...same problem by considering deterministic due date and random processing time was studied by Soroush and ... See full document
158
Related subjects