• No results found

machine scheduling problem

Solving Single Machine Scheduling Problem Using Type-2 Trapezoidal Fuzzy Numbers

Solving Single Machine Scheduling Problem Using Type-2 Trapezoidal Fuzzy Numbers

... single machine scheduling problem with single processor (Machine) consists of single machine to process ...single machine scheduling problems can provide help and insight ...

9

GENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS

GENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS

... single machine scheduling problem with only considering the sequence dependent set-up times are classified in NP-hard problems [3] and the considered problem with additional deterioration ...

7

A Bi criterion Simulated Annealing Method for a Single Batch processing Machine Scheduling Problem with Dynamic Job Release Times

A Bi criterion Simulated Annealing Method for a Single Batch processing Machine Scheduling Problem with Dynamic Job Release Times

... the problem of single batch-processing machine (BPM) scheduling with the objectives of minimizing the makespan and the total weighted number of tardy orders that has not been considered in the ...

5

Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines

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 ...this problem, they presented a mixed integer formulation that has substan- tially fewer ...

18

Single Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs

Single Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs

... the problem is described with a flowchart given in Figure ...original problem is constructed in which the existing jobs are direct or indirect predecessors of job i with the objective function of ...

7

Branch and Bound Algorithm for the Single Machine Scheduling Problem with Release and Delivery times

Branch and Bound Algorithm for the Single Machine Scheduling Problem with Release and Delivery times

... In fact, most heuristic algorithms can construct a nondelay schedule, which was defined by Baker [2] as a feasible schedule, with no processor being kept idle at the time when it could begin processing a task. An ...

11

Multi-criteria sequence-dependent single machine scheduling using genetic and simulated annealing algorithms

Multi-criteria sequence-dependent single machine scheduling using genetic and simulated annealing algorithms

... single machine scheduling problem with setup ...this problem is NP-hard, many researchers used a wide variety of metaheuristics to solve this problem, such as a genetic algorithm [7] ...

6

A genetic algorithm for preemptive scheduling of a single machine   Pages 607-614
		 Download PDF

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

8

A two-agent scheduling problem in a two-machine flowshop   Pages 289-306
		 Download PDF

A two-agent scheduling problem in a two-machine flowshop Pages 289-306 Download PDF

... the scheduling problem in a single-machine environment with the objective of minimizing the total weighted completion times of the first agent while the makespan of the second agent was ...the ...

18

A Particle Swarm Optimization to Minimize Makespan for a Four Stage Multiprocessor Open Shop with Dynamic Job Release Time

A Particle Swarm Optimization to Minimize Makespan for a Four Stage Multiprocessor Open Shop with Dynamic Job Release Time

... shop problem under certain objectives that has attracted considerable attention; MPOS prob- lem has been very limited with only a few studies to ...MPOS problem and applied Arena simulation model with five ...

6

Ant Colony Approach for Makespan Minimization on Unrelated Parallel Machines

Ant Colony Approach for Makespan Minimization on Unrelated Parallel Machines

... parallel machine scheduling problems using ant colony ...flowshop scheduling problems with the aim of minimizing the ...job-scheduling problem with the objective of reducing the ...

8

Online Full Text

Online Full Text

... single machine scheduling problem with the objective of minimizing total completion ...the problem by assuming that the ratio of the longest processing time to the shortest in any instance is ...

6

β   Robust Parallel Machine Scheduling with Uncertain Durations

β Robust Parallel Machine Scheduling with Uncertain Durations

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

6

Combined objective optimization in Identical 
		Parallel Machine Scheduling 
		problem using PSO

Combined objective optimization in Identical Parallel Machine Scheduling problem using PSO

... parallel machine scheduling problem for minimizing make span and minimizing number of tardy jobs simultaneously are proved to be NP-Hard problems ...production scheduling problems. The ...

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

... process, machine may not be available due to preventive maintenance, periodic repairs, tools changes or breakdown so a machine may require multi-maintenance activities to improve its production efficiency ...

7

A new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs   Pages 253-264
		 Download PDF

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 ...single machine scheduling problem considered this problem to minimize the ...

12

A Linear Programming Approach for Parallel Cell Scheduling with Sequence Dependent Setup Times

A Linear Programming Approach for Parallel Cell Scheduling with Sequence Dependent Setup Times

... the problem of scheduling on parallel machines in which the setup time is sequence- ...the problem as an integer program and for the general cases they developed a hybr- id genetic algorithm ...the ...

9

M-machine, no-wait flowshop scheduling with sequence dependent setup times and truncated learning function to minimize the makespan   Pages 309-322
		 Download PDF

M-machine, no-wait flowshop scheduling with sequence dependent setup times and truncated learning function to minimize the makespan Pages 309-322 Download PDF

... of scheduling with learning ...two machine flow shop problem by consideration truncated learning ...proposed problem. Liu and Feng (2014) considered two machine no-wait flow shop ...

14

Dynamic scheduling in a multi-product manufacturing system

Dynamic scheduling in a multi-product manufacturing system

... determine machine utilization. From the standpoint of job shop simulation, machine utilization is important because it affect queue ...the scheduling rules used in the model may not be forced to make ...

161

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

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

6

Show all 10000 documents...

Related subjects