Journal: Journal of Scheduling

Found 483 papers in total
Scheduling with tails and deadlines
Scheduling with tails and deadlines
2001,
This paper discusses scheduling problems that combine tails and deadlines or,...
A multiagent society for military transportation scheduling
A multiagent society for military transportation scheduling
2000,
We are in the process of building a proof-of-concept automated system for scheduling...
Integration of continuous caster and hot strip mill planning for steel production
Integration of continuous caster and hot strip mill planning for steel production
2000,
In this paper we present a model and a solution approach for integration of steel...
‘Aversion dynamics’ scheduling when the system changes
‘Aversion dynamics’ scheduling when the system changes
2000,
Real schedulers are observed to avoid scheduling rare and expensive jobs immediately...
Heuristics for minimizing total weighted tardiness in flexible flow shops
Heuristics for minimizing total weighted tardiness in flexible flow shops
2000,
Consider a flexible flow shop with s stages in series and at each stage a number of...
Parallel machine batching and scheduling with deadlines
Parallel machine batching and scheduling with deadlines
2000,
In this paper, we study the problem of scheduling n independent jobs non-preemptively...
A large step random walk for minimizing total weighted tardiness in a job shop
A large step random walk for minimizing total weighted tardiness in a job shop
2000,
We consider a job shop with m machines. There are n jobs and each job has a specified...
Decomposition methods for reentrant flow shops with sequence-dependent setup times
Decomposition methods for reentrant flow shops with sequence-dependent setup times
2000,
We consider the problem of scheduling a reentrant flow shop with sequence-dependent...
Non-bottleneck machines in three-machine flow shops
Non-bottleneck machines in three-machine flow shops
2000,
The paper deals with the classical problem of minimizing the makespan in a...
Resource augmentation in load balancing
Resource augmentation in load balancing
2000,
We consider load balancing in the following setting. The on-line algorithm is allowed...
New algorithms for related machines with temporary jobs
New algorithms for related machines with temporary jobs
2000,
We consider the on-line problem of assigning temporary jobs to related machines. In...
Applying extra-resource analysis to load balancing
Applying extra-resource analysis to load balancing
2000,
Previously, extra-resource analysis has been used to argue that certain on-line...
Fairness in parallel job scheduling
Fairness in parallel job scheduling
2000,
This paper introduces a new preemptive algorithm that is well suited for fair on-line...
A polynomial time approximation scheme for the average weighted completion time problem on unrelated machines
A polynomial time approximation scheme for the average weighted completion time problem on unrelated machines
2000,
We study the problem of scheduling n independent weighted jobs on a constant number of...
Restarts can help in the on-line minimization of the maximum delivery time on a single machine
Restarts can help in the on-line minimization of the maximum delivery time on a single machine
2000,
We consider a single-machine on-line scheduling problem where jobs arrive over time. A...
On-line scheduling revisited
On-line scheduling revisited
2000,
We present a new on-line algorithm, MR , for non-preemptive scheduling of jobs with...
On-line and off-line preemptive two-machine job shop scheduling
On-line and off-line preemptive two-machine job shop scheduling
2000,
We consider on-line and off-line algorithms for special cases of preemptive job shop...
Off-line admission control for general scheduling problems
Off-line admission control for general scheduling problems
2000,
We consider a class of scheduling problems which includes a variety of problems that...
Dynamic spectrum allocation: the impotency of duration notification
Dynamic spectrum allocation: the impotency of duration notification
2000,
For the classic dynamic storage/spectrum allocation problem, we show that knowledge of...
Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
2000,
There is considerable interest in the use of genetic algorithms to solve problems...
Effective neighbourhood functions for the flexible job shop problem
Effective neighbourhood functions for the flexible job shop problem
2000,
The flexible job shop problem is an extension of the classical job shop scheduling...
Frameworks for adaptable scheduling algorithms
Frameworks for adaptable scheduling algorithms
2000,
This paper considers the design of adaptable algorithms that aid the planning and...
Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
2000,
We consider the scheduling of N jobs divided into G families for processing on a...
Solution of the single machine total tardiness problem
Solution of the single machine total tardiness problem
1999,
The paper deals with the solution of the single machine total tardiness model. It...
Papers per page: