Make span
A New Heuristic Algorithm using Pascal’s Triangle to Determine more than one Sequence having Optimal/ near Optimal Make Span in Flow Shop Scheduling Problems
... Our objective is to find a processing order of the n jobs, the same for each machine, such that the make span is minimized. That is, the n jobs are finished as soon as possible. It is assumed that all jobs ...
7
MINIMIZATION OF THE MAKE-SPAN USING DYNAMIC PROGRAMMING APPROACH IN A MOUKA FOAM COMPANY
... the make- span using dynamic programming approach in a Mouka Foam ...with make span criterion that was used is n/m/F/c max (n-job, m-machine), with make span criterion that can ...
7
Optimizing Make Span and Total Completion Time Together to Improve the Performance of the Map Reduce Workloads
... Optimizing Make Span and Total Completion Time Together to Improve the Performance of the Map Reduce WorkloadsB. Tech Student, Department of CSE, Malineni Lakshmaiah Women’s Engineering[r] ...
6
Efficient Heuristics for Flow Shop Scheduling with make span Optimization Criteria
... In this thesis, we have implemented three heuristic rules of scheduling which was an attempt to provide comparison and effectiveness in the solution to a scheduling. we have discussed about all the results produced by ...
16
Combined objective optimization in Identical Parallel Machine Scheduling problem using PSO
... minimizing make span and minimizing number of tardy jobs simultaneously are proved to be NP-Hard problems ...minimizing make span and minimizing number of tardy jobs ...
5
Download Download PDF
... (2008) studied the problem and proposed a heuristic based on an analogy between the problem under consideration and the travelling salesman problem (TSP). Pan et al., (2008) presented a discrete particle swarm ...
15
Job Scheduling Using Coupling in Grid
... The nonfunctional properties of a resource are its availability, reliability and performance. If the resource al- located to a job is not reliable or it is of low performance or if it is not available, i.e. it is “down” ...
12
Improving production planning by flow shop scheduling algorithms : A case study at ForFarmers
... total make span (TMS) in Table 5.4 and the total make span of the press in Table ...total make span is smaller than the improvement in minutes of the total make ...
110
Dynamic Divisible Load Balancing Algorithm for Balancing Workload in Cloud Computing
... to make the cloud computing progressively effective and hence it improves the client ...the make span time of the system and get better throughput of the ...
8
A List Simulated Annealing Algorithm for Task Scheduling on Network-on-Chip
... In this paper, we combine list schedule and simulated annealing, and propose a list simulated annealing sched- uling algorithm to simultaneously optimize make-span, load balance and av[r] ...
7
A Novel Approach for Workflow Scheduling in Hybrid Cloud with Dynamic Datacenter
... less make span for the DAG than the main figuring and give us the best resources that we need to secure from open cloud to have enough planning vitality to arrange the work procedure inside given due ...
5
TLLB: Two Level Load Balanced Algorithm for Static Meta Task Scheduling in Grid Computing
... The algorithm proposed in this paper outperforms all those algorithms both in terms of make span, resource utilization, flow time and load balancing.. Thus a better load balancing is ach[r] ...
6
A Survey on Modified GA Based Load Balancing Based on Unreliable Resources in Cloud Computing Environment
... the make span which is the total length of the schedule, by decreasing the time taken to execute each node called the Computation cost and the communication cost, which the time is taken to transfer data ...
6
Finding An Optimal Sequence In The Flowshop Scheduling Using Johnson’S Algorithm
... the make span and also to establish the idle time for the machines in a flow shop scheduling environment by using Johnson’s algorithm for two machine problems and Extension of Johnson’s algorithm for three ...
6
Relational Rewards: Creating a Fulfilling Workplace Environment
... Availability of alternative machines is an important flexibility in FMS environment. In this project, the effect of alternative machines was also used. It was observed that the average make span was on ...
8
Differential Evolution and Simulated Annealing Technique for Design and Developing of Process Plan to Perform Optimization on Finite Capacity Scheduling for Simultaneous System of Machines
... technique for simultaneous scheduling of machines is defined as any computer program that uses advanced mathematical algorithm for logic to perform optimization and simultaneous on finite capacity scheduling and others. ...
5
INTELLIGENT SELF TUNING PID CONTROLLER USING HYBRID IMPROVED PARTICLE SWARM OPTIMIZATION FOR ULTRASONIC MOTOR
... As in our work we have focused on storage cloud which involves memory space we try to reduce the wastage of memory space in the VM by finding the best resource using the PSO algorithm and allocating the task to that ...
6
AN OVERVIEW OF WILL MANAGEMENT UNDER INDIAN LAW
... A Will or Testament is a direction and a legal declaration by which a person, the testator, names one or more persons to manage his/her possessions and properties and provides for the transfer of his/her possessions and ...
7
Articulatory loop explanations of memory span and pronunciation rate correspondences: a cautionary note
... memory span is purely a matter of word length, matching the various materials for spoken duration should result in equivalent span estimates for the different materials, since the same number of items in ...
8
Neuropsychological Profile and Performance Variability in Vascular Cognitive Impairment
... Attention span and working memory capacity were assessed by Digit Span and Spatial Span from Wechsler Memory Scale-III (WMS-III; [32]). Processing speed was assessed by Wechsler Adult Intelligence ...
13