1. (100%) Minimizing flowtime subject to optimal makespan on two identical parallel machines - Gupta,Jatinder N. D.; Ho,Johnny C.
We consider the problem of scheduling jobs on two parallel identical machines where an optimal schedule is defined as one that gives the smallest total flowtime (the sum of the completion time of all
(text/html) - 23-may-2005

2. (100%) Three Essays in Parallel Machine Scheduling - Garg, Amit
This research consists of three essays in parallel machine scheduling. The first two essays focus on the parallel multipurpose machine scheduling problem, while the last focuses on the parallel
(application/pdf; 115p.) - 07-jul-2009

3. (100%) MAKESPAN MINIMIZATION ON IDENTICAL PARALLEL MACHINES SUBJECT TO MINIMUM TOTAL FLOW-TIME - Jatinder N. D. Gupta; Johnny C. Ho; Alex J. Ruiz-torres
We consider the problem of scheduling n jobs on m identical parallel machines. An optimal schedule ... the last job on any one of the parallel machines) among the set of all schedules with optimal
(application/pdf) - 15-jul-2009

4. (100%) MINIMIZING FLOWTIME SUBJECT TO OPTIMAL MAKESPAN ON TWO IDENTICAL PARALLEL MACHINES - Jatinder N. D. Gupta A; Johnny C. Ho B
We consider the problem of scheduling jobs on two parallel identical machines where an optimal schedule is defined as one that gives the smallest total flowtime (the sum of the completion time of all
(application/pdf) - 16-jul-2009

5. (100%) Preemptive Scheduling of Identical Machines - Philippe Baptiste
preemptively scheduled on parallel identical machines. We rst provide a closed form expression for the ... Machine Scheduling, Preemption, Due-Dates, Dynamic Programming, Equal Processing Times 1
(application/postscript) - 24-jul-2009

6. (100%) Preemption Can Make Parallel Machine Scheduling Problems Hard - Peter Brucker; Svetlana Kravchenko
. Keywords: parallel machine scheduling, jobs with equal processing times, preemption, NP -hardness ... disproved a common belief that by preemption a scheduling problem becomes easier to solve. In this short
(application/postscript) - 31-jul-2009

7. (100%) Scheduling parallel CNC machines with time/cost trade-off considerations - Sinan Gurel; M. Selim Akturk
simultaneously on identical parallel CNC turning machines. Since decreasing processing time of a job increases ... times affect both the manufacturing cost and the scheduling performance.A well-known example for
(application/pdf) - 25-ago-2009

8. (100%) Parallel machine scheduling problems with a single server - Svetlana A. Kravchenko; Frank Werner
In this paper, we give a polynomial algorithm for problem P | rj, pj = p | � fj(Cj), where fj is an ...
(application/pdf) - 03-sep-2009

9. (100%) International Journal of Foundations of Computer Science c ○ World Scientific Publishing Company SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS - Monaldo Mastrolilli
address the unrelated parallel machines model and present the first known fully polynomial time ...Communicated by Editor’s name We investigate the max flow time scheduling problem in the off-line
(application/pdf) - 03-sep-2009

10. (100%) - Simon Dunstall A; Andrew Wirth B
Heuristic methods for the identical parallel machine owtime problem with set-up times
(application/pdf) - 24-sep-2009

Página de resultados:
1  2  3  4  5  6  7  8  9  Siguiente