[PDF] Top 20 Mecanismos de defensa del consumidor en el ordenamiento jurídico argentino
Has 10000 "Mecanismos de defensa del consumidor en el ordenamiento jurídico argentino" found on our website. Below are the top 20 most common "Mecanismos de defensa del consumidor en el ordenamiento jurídico argentino".
Optimized Crossover Genetic Algorithm to Minimize the Maximum Lateness of Single Machine Family Scheduling Problems
... a family to a single batch, and the second heuristic splits each family into at most two batches according to the due dates of its ...heuristic algorithm which selects the better of the ... See full document
5
(T max ). The problems with those objective functions are proven
... parallel machine scheduling with a bicriteria objective function which we tried to minimize makespan and maximum tardiness ...between single objectives. As a solution; we proposed a ... See full document
171
Multi-criteria sequence-dependent single machine scheduling using genetic and simulated annealing algorithms
... job scheduling on this single machine by trying to minimize downtime while respecting the different deadlines ...in single machine scheduling are very ...particular ... See full document
67
A new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs Pages 253-264 Download PDF
... deterioration scheduling problem in which the processing time of a job was a function of its starting ...for single machine scheduling problem considered this problem to minimize the ... See full document
15
Task Scheduling Using an Adaptive PSO Algorithm in Cloud Computing Environment
... Comparison of the proposed APSO algorithm with the PSO standard and the ACO. This test has been applied more than 50 times using a timeshare policy, regardless of the nature of the task, and the result is ... See full document
6
Integer batch scheduling problems for a single-machine with simultaneous effect of learning and forgetting to minimize total actual flow time Pages 365-378 Download PDF
... 100 problems. The results of comparison test show that the H-algorithm works adequately for any numbers of ...10 problems where input parameters are generated ... See full document
7
Optimized Association Rule Mining with Maximum Constraints using Genetic Algorithm
... using Genetic Algorithm. Currently Apriori algorithm uses the conjunctive nature of association rules, and the single minimum support factor to generate the effective ...Apriori ... See full document
84
Optimizing and analysing returns in commodity trading using Genetic Algorithm, Simulated Annealing and a novel algorithm (GaSa)
... Although commodity trading expires in different expiry periods, it has no effect on the fitness value computed. The fitness values for different expiry periods and for different combinations of algorithms fetch almost ... See full document
56
Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor
... an algorithm A via worst-case competitive analysis: A is r-competitive if for all request sequences σ we have α A (σ ) ≤ rα ∗ (σ) where α ∗ (σ) is the value of an optimum offline schedule for σ ...broadcast ... See full document
52
MINIMIZE THE BATCH DELIVERY IN MACHINE SCHEDULING
... the last job of the last batch delivery. It is clear that moving the last job on machine u to the last position on machine v will not increase the total penalty. Repeating this process, we can obtain a ... See full document
192
Efficient Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Unrelated Parallel Machines
... for scheduling n inde- pendent jobs on m unrelated parallel ...different problems (2X5, 2X6, ...of problems for which the optimality has been achieved is ...for scheduling n independent ... See full document
47
A New Job Shop Heuristic Algorithm for Machine Scheduling Problems
... solving scheduling problems. A new heuristic algorithm, with the objective of minimizing the makespan, is developed and presented in this paper for job shop scheduling problems ...JSP ... See full document
83
Timetable Handling Mechanism Using Python
... and genetic algorithm to generate the automatic time-table In 2014, Babaei, ...methods. Genetic algorithm to generate the automatic time-table –an over view is analyzed by Ansari, ... See full document
12
LPT Algorithm for Jobs with Similar Sizes on Three Machines
... time) algorithm is considered for sche- duling jobs with similar sizes on three ...to minimize the maximum completion time of all ...LPT algorithm is given as a piecewise linear function of r ... See full document
52
Scheduling Oriented Improvement of Kanban Card Resupplying in Logistic Systems at Automotive Industry
... some scheduling objective ...a scheduling model, we can consider the forecasted resupplying time (T × (1 + ) as a due time and supplying times as process ...to minimize as objective ...to ... See full document
51
Heuristics for Mixed Model Assembly Line Balancing Problem with Sequencing
... a genetic algorithm with the issues of worker schedules, product mix and launch ...a genetic algorithm for sequencing models through the workstations of the mixed- model assembly ...a ... See full document
5
Specially structured n × 2 flow shop scheduling problem with jobs in a string of disjoint job blocks including transportation time
... to minimize the rental cost of machines under pre-defined rental policy in which the probabilities have been associated with processing ...of scheduling models depends various factors such as job ... See full document
30
The efficient selection methods of genetic algorithm used in scheduling problems
... Scheduling problem is an assignment problem, which can be defined as the assigning of available resources (machines) to the activities (operations) in such a manner that maximizes the profitability, flexibility, ... See full document
9
Hybrid Algorithm for Optimization Problems Applied to Single Machine Scheduling
... optimization problems because they can give near solutions to combinatorial problems in reasonable time even for the biggest size problems, on the other hand, the exact methods (such as complete ... See full document
193
Special Case Algorithm for N-jobs M-machines Flow Shop Scheduling Problems
... Thus, the interchanging of job and I reduces the value of , . Hence, job should be done before job I . Therefore, the conditions stated in the above theorem are satisfied.Now, by repeatedly applying the above rule, , can ... See full document
20
Related subjects