Potts C.N.

C.N. Potts

Information about the author C.N. Potts will soon be added to the site.
Found 27 papers in total
Heuristics for a coupled-operation scheduling problem
Heuristics for a coupled-operation scheduling problem
2007
In this paper, we study a strongly NP-hard single machine scheduling problem in which...
Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs
Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs
2005
This paper considers the problem of scheduling a single machine to minimize the number...
Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach
Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach
2005
This paper considers the problem of scheduling jobs on unrelated parallel machines to...
Local search algorithms for the min–max loop layout problem
Local search algorithms for the min–max loop layout problem
2002
In the min–max loop layout problem, machines are to be arranged around a loop of...
Workload balancing and loop layout in the design of a flexible manufacturing system
Workload balancing and loop layout in the design of a flexible manufacturing system
2001
This paper considers combined scheduling and machine layout problems in a flexible...
Scheduling multi-operation jobs on a single machine
Scheduling multi-operation jobs on a single machine
1999
We consider the problem of scheduling n multi-operation jobs on a single machine. Each...
Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
1999
This paper develops a branch and bound algorithm for solving the single-machine...
Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
1998
This paper presents several branch and bound algorithms for a single-machine...
Local search heuristics for the single machine total weighted tardiness scheduling problem
Local search heuristics for the single machine total weighted tardiness scheduling problem
1998
This paper presents several local search heuristics for the problem of scheduling a...
Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
1996
Local search heuristics are developed for a problem of scheduling jobs on a single...
Scheduling for a multifunction phased array radar system
Scheduling for a multifunction phased array radar system
1996
A multifunction radar is a new, complex, radar system which combines the previously...
Single machine scheduling to minimize total weighted late work
Single machine scheduling to minimize total weighted late work
1995
In the problem of scheduling a single machine to minimize total weighted late work,...
The two-stage assembly scheduling problem: Complexity and approximation
The two-stage assembly scheduling problem: Complexity and approximation
1995
This paper introduces a new two-stage assembly scheduling problem. There are m...
The two-stage assembly scheduling problem: Complexity and approximation
The two-stage assembly scheduling problem: Complexity and approximation
1995
This paper introduces a new two-stage assembly scheduling problem. There are m...
Single machine scheduling with batch set-up times to minimize maximum lateness
Single machine scheduling with batch set-up times to minimize maximum lateness
1997
This paper considers a problem of scheduling N jobs on a single machine to minimize...
Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
1997
Local search heuristics are developed for a problem of scheduling a single machine to...
Single machine scheduling with deadlines to minimize the weighted number of tardy jobs
Single machine scheduling with deadlines to minimize the weighted number of tardy jobs
1994
This paper considers a single machine scheduling problem in which jobs have due dates...
Scheduling identical parallel machines to minimize total weighted completion time
Scheduling identical parallel machines to minimize total weighted completion time
1994
A branch and bound algorithm is proposed for the problem of scheduling jobs on...
A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work
A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work
1994
This paper studies approximation algorithms for the problem of nonpreemptively...
Integrating scheduling with batching and lot sizing: A review of algorithms and complexity
Integrating scheduling with batching and lot sizing: A review of algorithms and complexity
1992
In many practical situations, batching of similar jobs to avoid set-ups is performed...
Approximation algorithms for scheduling a single machine to minimize total late work
Approximation algorithms for scheduling a single machine to minimize total late work
1992
In the problem of scheduling a single machine to minimize total late work, there are n...
Single machine scheduling to minimize total late work
Single machine scheduling to minimize total late work
1992
In the problem of scheduling a single machine to minimize total late work, there are n...
Scheduling two job classes on a single machine
Scheduling two job classes on a single machine
1991
The problem of scheduling n jobs on a single machine is considered, where the jobs are...
Heuristics for scheduling unrelated parallel machines
Heuristics for scheduling unrelated parallel machines
1991
The problem of non-preemptively scheduling jobs on unrelated parallel machines to...
Papers per page: