Sciweavers

200 search results - page 18 / 40
» Job Shop Scheduling Problems with Controllable Processing Ti...
Sort
View
SCHEDULING
2008
97views more  SCHEDULING 2008»
13 years 8 months ago
Effective on-line algorithms for reliable due date quotation and large-scale scheduling
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
APPROX
2009
Springer
99views Algorithms» more  APPROX 2009»
14 years 3 months ago
Resource Minimization Job Scheduling
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
Julia Chuzhoy, Paolo Codenotti
EOR
2007
117views more  EOR 2007»
13 years 8 months ago
Considering manufacturing cost and scheduling performance on a CNC turning machine
A well known industry application that allows controllable processing times is the manufacturing operations on CNC machines. For each turning operation as an example, there is a n...
Sinan Gurel, M. Selim Akturk
COR
2007
80views more  COR 2007»
13 years 8 months ago
Scheduling with tool changes to minimize total completion time under controllable machining conditions
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...
M. Selim Akturk, Jay B. Ghosh, Rabia K. Kayan
ICALP
2004
Springer
14 years 2 months ago
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tom&aac...