• No results found

parallel machine scheduling

An imperialist competitive algorithm for a bi-objective parallel machine scheduling problem with load balancing consideration   Pages 191-202
		 Download PDF

An imperialist competitive algorithm for a bi-objective parallel machine scheduling problem with load balancing consideration Pages 191-202 Download PDF

... In this paper, we present a new Imperialist Competitive Algorithm (ICA) to solve a bi-objective unrelated parallel machine scheduling problem where setup times are sequence dependent. The objectives ...

12

Combined objective optimization in Identical 
		Parallel Machine Scheduling 
		problem using PSO

Combined objective optimization in Identical Parallel Machine Scheduling problem using PSO

... Identical Parallel Machine Scheduling problem including the minimization of makespan and number of tardy jobs ...for scheduling the jobs in IPMS problem confirms to be an effective and ...

5

A Hybrid Differential Particle Swarm Optimization Approach to Solve a Multi-objective Parallel Machine Scheduling Problem

A Hybrid Differential Particle Swarm Optimization Approach to Solve a Multi-objective Parallel Machine Scheduling Problem

... In this paper, we devise a hybrid approach by combining the searching ability of DE and PSO, namely HDEPSO, to solve multi-objective unrelated parallel machine scheduling with sequence-dependant ...

8

A Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness

A Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness

... Production scheduling is a decision-making process that plays a vital role in ...industries. Scheduling problems are often categorized by the machine configuration and ...of machine ...

18

A Hybrid Genetic Algorithm-based Approach to Solve Parallel Machine Scheduling with Job Delivery Coordination

A Hybrid Genetic Algorithm-based Approach to Solve Parallel Machine Scheduling with Job Delivery Coordination

... two parallel machines and delivered by a single delivery truck to customers located in close proximity to each other (defined as a one customer ...the parallel machine scheduling with batch ...

5

The Distributed Assembly Parallel Machine Scheduling Problem with eligibility constraints.

The Distributed Assembly Parallel Machine Scheduling Problem with eligibility constraints.

... m parallel machines instead of the two production machines in the first ...to machine eligibility constraints. In this paper, the parallel machine scheduling problem with unit ...

12

A Mathematical Model of a Multi-Criteria Parallel Machine Scheduling Problem: a Genetic Algorithm (RESEARCH NOTE)

A Mathematical Model of a Multi-Criteria Parallel Machine Scheduling Problem: a Genetic Algorithm (RESEARCH NOTE)

... of scheduling researches assume that setup times are negligible or part of the processing ...the scheduling of independent jobs with a common due date on a single machine has already been an NP-hard ...

8

Improving effectiveness of parallel machine scheduling with earliness and tardiness costs: A case study   Pages 375-392
		 Download PDF

Improving effectiveness of parallel machine scheduling with earliness and tardiness costs: A case study Pages 375-392 Download PDF

... of scheduling models depends on the characteristics of the system under study and the assumptions considered in the model ...the scheduling problem, for example, optimizing earliness and tardiness is one of ...

18

β   Robust Parallel Machine Scheduling with Uncertain Durations

β Robust Parallel Machine Scheduling with Uncertain Durations

... the parallel machine scheduling problem with uncertain durations, which finds robust schedules minimizing the probability of the total completion time exceeding a fixed ...robust parallel ...

6

Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times

Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times

... of scheduling models relevant to our study belongs to the area of imprecise computation; see [12] for a recent ...single machine or on parallel ...

40

Integrated approach in solving parallel machine scheduling and location (ScheLoc) problem   Pages 573-584
		 Download PDF

Integrated approach in solving parallel machine scheduling and location (ScheLoc) problem Pages 573-584 Download PDF

... The objective function minimizes the makespan, Eq. (21) ensures that each job is processed only on one machine, Eq. (22) specifies that job i can only be started when it reaches to machine j. Eq. (23) and ...

12

Ant Colony Approach for Makespan Minimization on Unrelated Parallel Machines

Ant Colony Approach for Makespan Minimization on Unrelated Parallel Machines

... unrelated parallel machine scheduling problems using ant colony ...flowshop scheduling problems with the aim of minimizing the ...unrelated parallel machine scheduling ...

8

Efficient Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Unrelated Parallel Machines

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 ...

11

(T max ). The problems with those objective functions are proven

(T max ). The problems with those objective functions are proven

... In this research, we studied parallel machine scheduling with a bicriteria objective function which we tried to minimize makespan and maximum tardiness simultaneously. We also added lambda to the ...

5

Two Stage Flow Shop Scheduling Model Including Transportation Time with Equipotential Machines at Every Stage

Two Stage Flow Shop Scheduling Model Including Transportation Time with Equipotential Machines at Every Stage

... of parallel machines problems. The conventional parallel machine scheduling includes scheduling of n jobs over m identical parallel machines ...on parallel machine ...

5

Unrelated Parallel Machines Scheduling with the Effect of Aging and Learning under Multi Maintenance Activities

Unrelated Parallel Machines Scheduling with the Effect of Aging and Learning under Multi Maintenance Activities

... In this paper we investigated unrelated parallel machine scheduling problems simultaneously with the effects of learning and aging and multi-maintenance activities. We aimed to find the optimal ...

7

Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines

Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines

... unrelated parallel machine scheduling problem in which the objective is to minimize the ...the scheduling problem stated ...unrelated parallel machines scheduling ...

11

Minimizing Makespan for Machine Scheduling and Worker Assignment Problem in Identical Parallel Machine Models Using GA

Minimizing Makespan for Machine Scheduling and Worker Assignment Problem in Identical Parallel Machine Models Using GA

... Parallel machine scheduling is important from both the theoretical and practical points of ...single machine scheduling ...in parallel. Parallel machine ...

6

Multiprocessor Scheduling Using Task
Duplication Based Scheduling Algorithms: A
Review Paper

Multiprocessor Scheduling Using Task Duplication Based Scheduling Algorithms: A Review Paper

... task scheduling is applied to a wide variety of problems for which there are multiple tasks to be performed on a number of ...Based Scheduling is the best technique to achieve minimum ...

7

Volume 2, Issue 7, July 2013 Page 388

Volume 2, Issue 7, July 2013 Page 388

... increasing. Parallel computing is a form of computation in which many calculations are carried out simultaneously, [1] operating on the principle that large problems can often be divided into smaller ones, which ...

5

Show all 10000 documents...

Related subjects