Journal: Journal of Scheduling

Found 483 papers in total
Efficient approximation schemes for scheduling problems with release dates and delivery times
Efficient approximation schemes for scheduling problems with release dates and delivery times
2003,
We consider the problem of scheduling n independent jobs on m identical machines that...
The one-machine problem with earliness and tardiness penalties
The one-machine problem with earliness and tardiness penalties
2003,
We address the one-machine problem in which the jobs have distinct due dates,...
A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs
A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs
2003,
We consider the single machine multi-operation jobs scheduling problem to minimize the...
Preemptive scheduling with dedicated processors: applications of fractional graph coloring
Preemptive scheduling with dedicated processors: applications of fractional graph coloring
2004,
We study the problem of scheduling independent multiprocessor tasks, where for each...
Sensitivity analysis for scheduling problems
Sensitivity analysis for scheduling problems
2004,
This paper represents a first attempt at a systematic study of sensitivity analysis...
Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
2004,
The weakly NP-hard single-machine total tardiness scheduling problem has been...
Best-case response times and jitter analysis of real-time tasks
Best-case response times and jitter analysis of real-time tasks
2004,
In this paper, we present a simple recursive equation and an iterative procedure to...
Scheduling protocols for switches with large envelopes
Scheduling protocols for switches with large envelopes
2004,
Traditionally, switches make scheduling decisions on the granularity of a packet....
Approximation algorithms for average stretch scheduling
Approximation algorithms for average stretch scheduling
2004,
We study the basic problem of preemptive scheduling of a stream of jobs on a single...
NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
2004,
We consider the version of broadcast scheduling where a server can transmit W messages...
A weighted modified due date rule for sequencing to minimize weighted tardiness
A weighted modified due date rule for sequencing to minimize weighted tardiness
2004,
Priority dispatching for minimizing job tardiness has been the subject of research...
Predictive, stochastic and dynamic extensions to aversion dynamics scheduling
Predictive, stochastic and dynamic extensions to aversion dynamics scheduling
2004,
Schedulers' decisions in real factories deal with perceived risks and impacts. They...
An improved randomized on-line algorithm for a weighted interval selection problem
An improved randomized on-line algorithm for a weighted interval selection problem
2004,
Given a set of weighted intervals, the objective of the weighted interval selection...
Minimizing total completion time subject to job release dates and preemption penalties
Minimizing total completion time subject to job release dates and preemption penalties
2004,
Extensive research has been devoted to preemptive scheduling. However, little...
Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
2004,
One of the first problems to be studied in scheduling theory was the problem of...
Scheduling search procedures
Scheduling search procedures
2004,
We analyze preemptive on-line scheduling against randomized adversaries, with the goal...
Robotic cells with parallel machines: throughput maximization in constant travel-time cells
Robotic cells with parallel machines: throughput maximization in constant travel-time cells
2004,
We present a general analysis of the problem of sequencing operations in bufferless...
An exact method to minimize the number of tardy jobs in single machine scheduling
An exact method to minimize the number of tardy jobs in single machine scheduling
2004,
This paper considers the problem of scheduling n jobs on a single machine to minimize...
The on-line multiprocessor scheduling problem with known sum of the tasks
The on-line multiprocessor scheduling problem with known sum of the tasks
2004,
In this paper we investigate a semi on-line multiprocessor scheduling problem. The...
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
2003,
The unit price seat reservation problem is investigated. The seat reservation problem...
Models and algorithms for integration of vehicle and crew scheduling
Models and algorithms for integration of vehicle and crew scheduling
2003,
This paper deals with models, relaxations, and algorithms for an integrated approach...
Performance bounds of algorithms for scheduling advertisements on a Web page
Performance bounds of algorithms for scheduling advertisements on a Web page
2003,
Consider a set of n advertisements (hereafter called ‘ads’) A ={A 1...
Approximating the advertisement placement problem
Approximating the advertisement placement problem
2004,
The advertisement placement problem deals with space and time sharing by...
Bus and buffer usage in in-home digital networks: applying the Dantzig–Wolfe decomposition
Bus and buffer usage in in-home digital networks: applying the Dantzig–Wolfe decomposition
2004,
In an in-home digital network several data streams (audio, video) may run...
Papers per page: