Sciweavers

614 search results - page 11 / 123
» Resource Minimization Job Scheduling
Sort
View
CORR
2004
Springer
102views Education» more  CORR 2004»
14 years 11 months ago
Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time
Philippe Baptiste, Marek Chrobak, Christoph Dü...
EOR
2007
82views more  EOR 2007»
14 years 11 months ago
Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
: New semiconductor wafer fabrication facilities use Front Opening Unified Pods (FOUPs) as a common unit of wafer transfer. Since the number of pods is limited due to high costs, a...
Jeffrey D. Laub, John W. Fowler, Ahmet B. Keha
IPPS
2009
IEEE
15 years 6 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
PDPTA
2004
15 years 1 months ago
Evaluation of a Job Admission Algorithm for Bandwidth Constrained Grids
Abstract One of the goals envisioned by Grid computing is to make the execution of both computational and data-intensive problems possible. A key problem is finding the optimal set...
Marc De Leenheer, Pieter Thysebaert, Bruno Volckae...
CORR
2008
Springer
85views Education» more  CORR 2008»
14 years 11 months ago
Online Scheduling to Minimize the Maximum Delay Factor
In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcast...
Chandra Chekuri, Benjamin Moseley