Parallel Machines
Simulated Annealing Algorithm to Minimize Makespanin Single Machine Scheduling Problem withUniform Parallel Machines
... This section presents a simulated annealing algorithm to minimize the makespan in the single machine scheduling problem with uniform parallel machines. The simulated annealing algorithm has emerged from ...
10
Decomposing & mapping neural systems onto general-purpose parallel machines
... Considering the size involved in the four levels of parallelism as a criteria, then process and block level parallelisms can be referred to as coarse grain parallelism, while instruction and sub-instruction parallelisms ...
195
Ordinal Semi On Line Scheduling for Jobs with Arbitrary Release Times on Identical Parallel Machines
... In this paper, we investigate the problem of semi-on-line scheduling n jobs on m identical parallel machines under the assumption that the ordering of the jobs by processing time is known and the jobs have ...
10
Parallel machines scheduling with applications to Internet ad-slot placement
... of parallel machines in particular we have illustrated examples pertaining to uniform parallel machines and its application in the real ...of machines. When the speeds relating to the ...
69
Stochastic Programming Model for Discrete Lotsizing and Scheduling Problem on Parallel Machines
... In recent years, it has been difficult for manufactures and suppliers to forecast demand from a market for a given prod- uct precisely. Therefore, it has become important for them to cope with fluctuations in demand. ...
8
Efficient Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Unrelated Parallel Machines
... Mokotoff and Chretienne [5] have developed a cutting plane algorithm for the unrelated parallel machine scheduling problem, which minimizes the makespan. Their algorithm deals with the polyhedral structure of this ...
11
Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines
... uniform parallel ma- chines to minimize the sum of earliness and tardiness ...different machines based on the characteristics of the ...uniform parallel machines such that the total tardiness ...
18
Unrelated Parallel Machines Scheduling with the Effect of Aging and Learning under Multi Maintenance Activities
... Abstract Maintenance is important to manufacturing process with a view to sustaining production efficiency. In this study scheduling of unrelated parallel machines with effects of learning and aging and ...
7
Some Solution Approaches to Reduce the Imbalance of Workload in Parallel Machines while Planning in Flexible Manufacturing System
... From the literature reviewed it appears that two objectives, workload balance and throughput, have attracted maximum research attention. In the context of FMS involving high capital investment, the genuine objective of ...
7
Preemptive scheduling on uniform parallel machines with controllable job processing times
... Abstract In this paper, we provide a unified approach to solving preemptive schedul- ing problems with uniform parallel machines and controllable processing times. We demonstrate that a single criterion ...
24
A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines
... Abstract. In this paper, we present a general methodology for designing polynomial-time algorithms for bicriteria scheduling problems on parallel machines with controllable processing times. For each ...
20
An ordered heuristic for the allocation of resources in unrelated parallel-machines Pages 145-156 Download PDF
... Global competition pressures have forced manufactures to adapt their productive capabilities. In order to satisfy the ever-changing market demands many organizations adopted flexible resources capable of executing ...
12
Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines
... with parallel machines and unit processing times by providing necessary and sufficient con- ditions of ...for parallel machine scheduling are equivalent to detecting negative cycles in a specially ...
27
A Metaheuristic approach for Batch Sizing and Scheduling Problem in Flexible Flow Shop with Unrelated Parallel Machines
... The scheduling of n jobs through m stages where, at any stage, there exists one or more unrelated processors, is termed as flexible flow shop (FFS), flexible flow line (FFL), hybrid flow shop (HFS), or a flow shop with ...
6
JOB SEQUENCE TO MINIMIZE THE WORKLOAD IMBALANCE ON PARALLEL MACHINES THROUGH GENETIC ALGORITHM
... In this work an effort is made to carry out the case study for ten different part styles with different batch quantity on two vertical machining centre with the application of GA to reduce the workload imbalance on the ...
7
Scheduling reentrant jobs on parallel machines with a remote server
... a parallel machines with a common server ...identical parallel machines with a single server and different objective functions were obtained by Hall et ...with parallel dedicated ...
39
Lagrangian relaxation approach to minimize makespan for hybrid flow shop scheduling problem with unrelated parallel machines
... Emami et al. [20] proposed Lagrangian relaxation algorithm for robust Order Acceptance and Scheduling (OAS) problem in an unrelated parallel machines en- vironment to maximize the prot. They also applied a ...
11
GA Based Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Uniform Parallel Machines
... Panneerselvam Senthilkumar and Sockalingam Nara- yanan [17] have developed a simulated annealing algo- rithm to minimize the makespan in the single machine scheduling problem with uniform parallel machines. ...
11
The Problem of Scheduling in Parallel Machines: A Case Study
... identical parallel machines with setup times and sequence dependent [18], have been found, but none of them considers the lot sizing and scheduling restrictions associated neither with the equipments nor to ...
6
An Efficient Parallel Substrate for Typed Feature Structures on Shared Memory Parallel Machines
... An Efficient Parallel Substrate for Typed Feature Structures on Shared Memory Parallel Machines A n E f f i c i e n t P a r a l l e l S u b s t r a t e for T y p e d F e a t u r e S t r u c t u r e s[.] ...
7