Journal: Journal of Scheduling

Found 483 papers in total
Scheduling trees with large communication delays on two identical processors
Scheduling trees with large communication delays on two identical processors
2005,
We consider the problem of scheduling trees on two identical processors in order to...
New single machine and job-shop scheduling problems with availability constraints
New single machine and job-shop scheduling problems with availability constraints
2005,
In this paper we deal with variants of traditional cases of unavailability constraints...
Pre-emptive scheduling problems with controllable processing times
Pre-emptive scheduling problems with controllable processing times
2005,
We consider a range of single machine and identical parallel machine pre-emptive...
Bicriteria approximation algorithms for scheduling problems with communications delays
Bicriteria approximation algorithms for scheduling problems with communications delays
2005,
We study the problem of simultaneously minimizing the makespan and the average...
Solution of the Liu–Layland problem via bottleneck just-in-time sequencing
Solution of the Liu–Layland problem via bottleneck just-in-time sequencing
2005,
This paper proposes a new approach to the well-known Liu–Layland periodic...
Order scheduling in an environment with dedicated resources in parallel
Order scheduling in an environment with dedicated resources in parallel
2005,
We consider m machines in parallel with each machine capable of producing one specific...
Sequencing and scheduling in robotic cells: recent developments
Sequencing and scheduling in robotic cells: recent developments
2005,
A great deal of work has been done to analyze the problem of robot move sequencing and...
Data-dependency graph transformations for instruction scheduling
Data-dependency graph transformations for instruction scheduling
2005,
This paper presents a set of efficient graph transformations for local instruction...
Maximizing weighted number of just-in-time jobs on unrelated parallel machines
Maximizing weighted number of just-in-time jobs on unrelated parallel machines
2005,
We are concerned with problems of scheduling jobs non-preemptively with the objective...
Sensitivity bounds for machine scheduling with uncertain communication delays
Sensitivity bounds for machine scheduling with uncertain communication delays
2005,
The paper deals with the scheduling of tasks on a set of parallel machines subject to...
Minimizing total weighted tardiness in a generalized job shop
Minimizing total weighted tardiness in a generalized job shop
2005,
We consider a generalization of the classical job shop scheduling problem with release...
Two-machine stochastic flow shops with blocking and the traveling salesman problem
Two-machine stochastic flow shops with blocking and the traveling salesman problem
2005,
The paper deals with the problem of minimizing the expected makespan in a two-machine...
A note on the scheduling with two families of jobs
A note on the scheduling with two families of jobs
2005,
Baker and Smith introduced a new model of scheduling in which there are two or more...
Mathematical programming and financial objectives for scheduling projects
Mathematical programming and financial objectives for scheduling projects
2005,
The task assignment problem for unrestricted movement between workstation groups
The task assignment problem for unrestricted movement between workstation groups
2006,
The purpose of this paper is to investigate the problem of assigning tasks to workers...
A computational study of a cutting plane algorithm for university course timetabling
A computational study of a cutting plane algorithm for university course timetabling
2005,
In this paper, we describe a case-study where a Branch-and-Cut algorithm yields the...
Scheduling web advertisements: a note on the minspace problem
Scheduling web advertisements: a note on the minspace problem
2005,
Free services to internet users are commonly available on many web sites, e.g.,...
Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems
Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems
2005,
In Universal Mobile Telecommunications Systems radio access, information packets of...
A hard dial-a-ride problem that is easy on average
A hard dial-a-ride problem that is easy on average
2005,
In the dial-a-ride-problem (Darp) objects have to be moved between given sources and...
Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems
Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems
2005,
The quality of an approximate solution for combinatorial optimization problems with a...
Discovering dispatching rules using data mining
Discovering dispatching rules using data mining
2005,
This paper introduces a novel methodology for generating scheduling rules using a...
Scheduling space–ground communications for the Air Force Satellite Control Network
Scheduling space–ground communications for the Air Force Satellite Control Network
2004,
We present the first coupled formal and empirical analysis of the Satellite Range...
A flexible system for scheduling drivers
A flexible system for scheduling drivers
2003,
A substantial part of the operating costs of public transport is attributable to...
Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms
Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms
2003,
We consider the maximum disjoint paths problem and its generalization, the call...
Papers per page: