Journal: Journal of Scheduling

Found 483 papers in total
A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
1999,
We consider the problem of minimizing the sum of weighted completion times of jobs...
The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling
The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling
1999,
The Coors warehouse scheduling problem involves finding a permutation of customer...
Minimizing makespan in a pallet-constrained flowshop
Minimizing makespan in a pallet-constrained flowshop
1999,
We consider the problem of scheduling n jobs in a pallet-constrained flowshop so as to...
Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines
Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines
1999,
The single-stage scheduling problem to minimize the makespan of identical jobs with...
A new tabu search procedure for an audit-scheduling problem
A new tabu search procedure for an audit-scheduling problem
1999,
We consider the following version of the auditing problem. A set of jobs must be...
A hybrid genetic/optimization algorithm for a task allocation problem
A hybrid genetic/optimization algorithm for a task allocation problem
1999,
We consider the problem of designing a distributed computing system for handling a set...
Polynomial time approximation algorithms for machine scheduling: Ten open problems
Polynomial time approximation algorithms for machine scheduling: Ten open problems
1999,
We discuss what we consider to be the 10 most vexing open questions in the area of...
On the approximability of an interval scheduling problem
On the approximability of an interval scheduling problem
1999,
In this paper we consider a general interval scheduling problem. The problem is a...
Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
1999,
We study the problem of minimizing the weighted number of late jobs to be scheduled on...
Proportionate flow shop with controllable processing times
Proportionate flow shop with controllable processing times
1999,
This paper considers a special class of flow-shop problems, known as the proportionate...
Approximability of scheduling with fixed jobs
Approximability of scheduling with fixed jobs
1999,
Scheduling problems of minimizing the makespan on identical parallel machines are...
Single-vehicle scheduling with time window constraints
Single-vehicle scheduling with time window constraints
1999,
In the single-vehicle scheduling problem with time window constraints, a vehicle has...
Optimizing cane supply decisions within a sugar mill region
Optimizing cane supply decisions within a sugar mill region
1999,
A sugar mill region contains large differences in sugar yield due to harvest date,...
Scheduling multicast input-queued switches
Scheduling multicast input-queued switches
1999,
The use of multicast transmissions, in which users broadcast their data (typically...
Installing an urban transport scheduling system
Installing an urban transport scheduling system
1999,
Bus and driver scheduling methods developed by the authors and their associates form...
Optimization of template-driven scheduling mechanisms: Regularity measures and computational techniques
Optimization of template-driven scheduling mechanisms: Regularity measures and computational techniques
1999,
Template-driven scheduling mechanisms provide a simple and robust scheme for sharing a...
Cyclic scheduling in 3-machine robotic flow shops
Cyclic scheduling in 3-machine robotic flow shops
1999,
We consider a robotic flow shop model in which a single robot is responsible for the...
Optimal robot scheduling for Web search engines
Optimal robot scheduling for Web search engines
1998,
A robot is deployed by a Web search engine in order to maintain the currency of its...
Scheduling a batching machine
Scheduling a batching machine
1998,
We address the problem of scheduling n jobs on a batching machine to minimize regular...
Approximation schemes for scheduling on parallel machines
Approximation schemes for scheduling on parallel machines
1998,
We discuss scheduling problems with m identical machines and n jobs where each job has...
On-line machine covering
On-line machine covering
1998,
We consider the problem of scheduling a sequence of jobs on m parallel identical...
A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times
A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times
1998,
We investigate the single-machine sequencing problem in which each job has a...
The ODO project: Toward a unified basis for constraint-directed scheduling
The ODO project: Toward a unified basis for constraint-directed scheduling
1998,
The ODO project is an inquiry into constraint-directed scheduling with the primary...
A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour
A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour
1998,
In this paper we present a tabu search approach for a single-machine batching problem....
Papers per page: