Heuristics for the local grid scheduling problem with processing time constraints

2015 ◽  
Vol 21 (4) ◽  
pp. 523-547 ◽  
Author(s):  
Lucio Grandinetti ◽  
Francesca Guerriero ◽  
Luigi Di Puglia Pugliese ◽  
Mehdi Sheikhalishahi
Keyword(s):  
Processing Time ◽  
Time Constraints ◽  
Scheduling Problem ◽  
Grid Scheduling ◽  
Local Grid

The Research of Heuristic Algorithm for Flow Shop Scheduling Problem

2012 ◽  
Vol 605-607 ◽  
pp. 528-531
Author(s):  
Dan Tang ◽  
Hong Ping Shu
Keyword(s):  
Heuristic Algorithm ◽  
Processing Time ◽  
Flow Shop ◽  
Heuristic Method ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Average Quality ◽  
Simulation Experiments ◽  
Shop Scheduling ◽  
Better Than

For the flow shop scheduling problem which aims to minimize makespan, this paper gives a new derivation about its mathematical definition, and mining characteristics of the problem itself further. By which analysis, the new heuristic method proposed in the paper shorten the waiting time of each job as much as possible on the basis of reduce the processing time of the first machine and last job. The result of simulation experiments shows that, our new heuristic algorithm has good performance, and the average quality and stability of scheduling sequences generated by new method is significantly better than other heuristic algorithm which has the same complexity.

A STOCHASTIC BATCHING AND SCHEDULING PROBLEM

2001 ◽  
Vol 15 (4) ◽  
pp. 465-479 ◽  
Author(s):  
Ger Koole ◽  
Rhonda Righter
Keyword(s):  
Optimal Policy ◽  
Semiconductor Manufacturing ◽  
Processing Time ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Flow Time ◽  
Batch Scheduling ◽  
Scheduling Problem ◽  
Processing Times ◽  
Deterministic Problem

We consider a batch scheduling problem in which the processing time of a batch of jobs equals the maximum of the processing times of all jobs in the batch. This is the case, for example, for burn-in operations in semiconductor manufacturing and other testing operations. Processing times are assumed to be random, and we consider minimizing the makespan and the flow time. The problem is much more difficult than the corresponding deterministic problem, and the optimal policy may have many counterintuitive properties. We prove various structural properties of the optimal policy and use these to develop a polynomial-time algorithm to compute the optimal policy.

Local grid scheduling techniques using performance prediction

2003 ◽  
Vol 150 (2) ◽  
pp. 87 ◽  
Author(s):  
D.P. Spooner ◽  
S.A. Jarvis ◽  
J. Cao ◽  
S. Saini ◽  
G.R. Nudd
Keyword(s):  
Performance Prediction ◽  
Grid Scheduling ◽  
Local Grid
Sign in / Sign up

Export Citation Format

Share Document