Search Sciweavers | Sciweavers

20

ORL
2008

87views more ORL 2008»

On-line scheduling with non-crossing constraints

13 years 6 months ago

We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...

Lele Zhang, Kwanniti Khammuang, Andrew Wirth

claim paper

Read More »

27

click to vote

SCHEDULING
2008

97views more SCHEDULING 2008»

Effective on-line algorithms for reliable due date quotation and large-scale scheduling

13 years 7 months ago

Download ieor.berkeley.edu

We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job's arrival time, a due date must be quoted for the job, and the job must...

Philip Kaminsky, Zu-Hsu Lee

claim paper

Read More »

29

click to vote

IEEEPACT
2008
IEEE

136views Distributed And Parallel Com...» more IEEEPACT 2008»

Feature selection and policy optimization for distributed instruction placement using reinforcement learning

14 years 2 months ago

Download userweb.cs.utexas.edu

Communication overheads are one of the fundamental challenges in a multiprocessor system. As the number of processors on a chip increases, communication overheads and the distribu...

Katherine E. Coons, Behnam Robatmili, Matthew E. T...

claim paper

Read More »

18

click to vote

EOR
2008

93views more EOR 2008»

A survey of surface mount device placement machine optimisation: Machine classification

13 years 7 months ago

Download www.ftsm.ukm.my

The optimisation of a printed circuit board assembly line is mainly influenced by the constraints of the surface mount device (SMD) placement machine and the characteristics of th...

Masri Ayob, Graham Kendall

claim paper

Read More »

19

click to vote

CGF
2004

77views more CGF 2004»

Stellar Mesh Simplification Using Probabilistic Optimization

13 years 7 months ago