Journal: Journal of Scheduling

Found 483 papers in total
Revisiting branch and bound search strategies for machine scheduling problems
Revisiting branch and bound search strategies for machine scheduling problems
2004,
In the design of exact methods for NP-hard machine scheduling problems, branch and...
Simple algorithms for Gilmore–Gomory's traveling salesman and related problems
Simple algorithms for Gilmore–Gomory's traveling salesman and related problems
2003,
We reconsider the version of the traveling salesman problem (TSP) first studied in a...
On-line algorithms for the dynamic traveling repair problem
On-line algorithms for the dynamic traveling repair problem
2004,
We consider the dynamic traveling repair problem in which requests with deadlines...
The state of the art of nurse rostering
The state of the art of nurse rostering
2004,
Nurse rostering is a complex scheduling problem that affects hospital personnel on a...
Quality control for scalable media processing applications
Quality control for scalable media processing applications
2004,
Many media processing applications create a load that varies significantly over time....
A multiple-criterion model for machine scheduling
A multiple-criterion model for machine scheduling
2003,
We consider a scheduling problem involving a single processor being utilized by two or...
RanGen: A random network generator for activity-on-the-node networks
RanGen: A random network generator for activity-on-the-node networks
2003,
In this paper, we describe RanGen, a random network generator for generating...
Rescheduling manufacturing systems: a framework of strategies, policies, and methods
Rescheduling manufacturing systems: a framework of strategies, policies, and methods
2003,
Many manufacturing facilities generate and update production schedules, which are...
Part batching and scheduling in a flexible cell to minimize setup costs
Part batching and scheduling in a flexible cell to minimize setup costs
2003,
In this paper we consider the problem of batching parts and scheduling their...
On-line restricted caching
On-line restricted caching
2003,
We study the on-line caching problem in a restricted cache where each memory item can...
On-line multi-threaded scheduling
On-line multi-threaded scheduling
2003,
On-line scheduling problems are studied with jobs organized in a number of sequences...
Patience is a virtue: the effect of slack on competitiveness for admission control
Patience is a virtue: the effect of slack on competitiveness for admission control
2003,
We consider the on-line competitiveness for scheduling a single resource...
Competitive deadline scheduling via additional or faster processors
Competitive deadline scheduling via additional or faster processors
2003,
This paper studies on-line scheduling in a single-processor system that allows...
Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics
Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics
2003,
This work theoretically proves that Equi-partition efficiently schedules...
Competitive on-line scheduling with level of service
Competitive on-line scheduling with level of service
2003,
Motivated by an application in thinwire visualization, we study an abstract on-line...
Admission control with immediate notification
Admission control with immediate notification
2003,
When admission control is used, an on-line scheduler chooses whether or not to...
Scheduling with conflicts on bipartite and interval graphs
Scheduling with conflicts on bipartite and interval graphs
2003,
In this paper, we consider the on-line scheduling of jobs that may be competing for...
Barely random algorithms for multiprocessor scheduling
Barely random algorithms for multiprocessor scheduling
2003,
We consider randomized algorithms for on-line scheduling on identical machines. For...
Scheduling and lot streaming in flowshops with no-wait in process
Scheduling and lot streaming in flowshops with no-wait in process
2003,
Lot streaming involves splitting a production lot into a number of sublots, in order...
Complexity of one-cycle robotic flow-shops
Complexity of one-cycle robotic flow-shops
2003,
We study the computational complexity of finding the shortest route the robot should...
A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness
A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness
2003,
We study the scheduling situation where n tasks, subjected to release dates and due...
Concurrent open shop scheduling to minimize the weighted number of tardy jobs
Concurrent open shop scheduling to minimize the weighted number of tardy jobs
2003,
We consider a relaxed version of the open shop scheduling problem – the...
Timing analysis of compound scheduling policies: application to Posix 1003.1B
Timing analysis of compound scheduling policies: application to Posix 1003.1B
2003,
The analysis of fixed priority preemptive scheduling has been extended in various ways...
The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
2003,
In this paper, we consider the single machine batching problem with family setup times...
Papers per page: