Chris Potts - Academia.edu (original) (raw)

Uploads

Papers by Chris Potts

Research paper thumbnail of Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity

The Journal of the Operational Research Society, 1992

In many practical situations, batching of similar jobs to avoid setups is performed whilst constr... more In many practical situations, batching of similar jobs to avoid setups is performed whilst constructing a schedule. On the other hand, each job may consist of many identical items. Splitting a job often results in improved customer service or in reduced throughput time. Thus, implicit in determining a schedule is a lot-sizing decision which specifies how a job is to be split. This paper proposes a general model which combines batching and lot-sizing decisions with scheduling. A review of research on this type of model is given. Some important open problems for which further research is required are also highlighted.

Research paper thumbnail of Fifty years of scheduling: a survey of milestones

Journal of the Operational Research Society, 2009

Scheduling has become a major field within operational research with several hundred publications... more Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid 1950s when the landmark publications started to appear. A discussion of the main topics of scheduling research for the past five decades is provided, highlighting the key contributions that helped shape the subject. The main topics covered in the respective decades are combinatorial analysis, branch and bound, computational complexity and classification, approximate solution algorithms, and enhanced scheduling models.

Research paper thumbnail of Constraint satisfaction problems: Algorithms and applications

European Journal of Operational Research, 1999

Research paper thumbnail of Makespan minimisation on unrelated parallel machines: a Recovering Beam Search approach

European Journal of Operational Research - EJOR

This paper describes the application of the recently introduced Re- covering Beam Search (RBS) me... more This paper describes the application of the recently introduced Re- covering Beam Search (RBS) method for the problem of scheduling in- dependent tasks on unrelated machines to minimize the makespan. The proposed polynomial time algorithm is able to generate approximate so- lutions to problems with large size (up to 1000 jobs) within few minutes.

Research paper thumbnail of The bounded knapsack problem with setups

… PAPERS-INSEAD R AND …, 1997

... Page 2. The Bounded Knapsack Problem with Setups Haldun Sural*, Luk N. Van Wassenhove* and Ch... more ... Page 2. The Bounded Knapsack Problem with Setups Haldun Sural*, Luk N. Van Wassenhove* and Chris N. Potts** * Technology Management Area, 1NSEAD, Fontainebleau, France ** Faculty ofMathematical Studies, University of Southampton, U. Abstract ...

Research paper thumbnail of Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach

European Journal of Operational Research, 2005

This paper considers the problem of scheduling jobs on unrelated parallel machines to minimize th... more This paper considers the problem of scheduling jobs on unrelated parallel machines to minimize the makespan. Recovering Beam Search is a recently introduced method for obtaining approximate solutions to combinatorial optimization problems. A traditional Beam Search algorithm is a type of truncated branch and bound algorithm approach. However, Recovering Beam Search allows the possibility of correcting wrong decisions by replacing partial solutions with others. We develop a Recovering Beam Search algorithm for our unrelated parallel machine scheduling problem that requires polynomial time. Computational results show that it is able to generate approximate solutions for instances with large size (up to 1000 jobs) using a few minutes of computation time.

Research paper thumbnail of Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity

The Journal of the Operational Research Society, 1992

In many practical situations, batching of similar jobs to avoid setups is performed whilst constr... more In many practical situations, batching of similar jobs to avoid setups is performed whilst constructing a schedule. On the other hand, each job may consist of many identical items. Splitting a job often results in improved customer service or in reduced throughput time. Thus, implicit in determining a schedule is a lot-sizing decision which specifies how a job is to be split. This paper proposes a general model which combines batching and lot-sizing decisions with scheduling. A review of research on this type of model is given. Some important open problems for which further research is required are also highlighted.

Research paper thumbnail of Fifty years of scheduling: a survey of milestones

Journal of the Operational Research Society, 2009

Scheduling has become a major field within operational research with several hundred publications... more Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid 1950s when the landmark publications started to appear. A discussion of the main topics of scheduling research for the past five decades is provided, highlighting the key contributions that helped shape the subject. The main topics covered in the respective decades are combinatorial analysis, branch and bound, computational complexity and classification, approximate solution algorithms, and enhanced scheduling models.

Research paper thumbnail of Constraint satisfaction problems: Algorithms and applications

European Journal of Operational Research, 1999

Research paper thumbnail of Makespan minimisation on unrelated parallel machines: a Recovering Beam Search approach

European Journal of Operational Research - EJOR

This paper describes the application of the recently introduced Re- covering Beam Search (RBS) me... more This paper describes the application of the recently introduced Re- covering Beam Search (RBS) method for the problem of scheduling in- dependent tasks on unrelated machines to minimize the makespan. The proposed polynomial time algorithm is able to generate approximate so- lutions to problems with large size (up to 1000 jobs) within few minutes.

Research paper thumbnail of The bounded knapsack problem with setups

… PAPERS-INSEAD R AND …, 1997

... Page 2. The Bounded Knapsack Problem with Setups Haldun Sural*, Luk N. Van Wassenhove* and Ch... more ... Page 2. The Bounded Knapsack Problem with Setups Haldun Sural*, Luk N. Van Wassenhove* and Chris N. Potts** * Technology Management Area, 1NSEAD, Fontainebleau, France ** Faculty ofMathematical Studies, University of Southampton, U. Abstract ...

Research paper thumbnail of Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach

European Journal of Operational Research, 2005

This paper considers the problem of scheduling jobs on unrelated parallel machines to minimize th... more This paper considers the problem of scheduling jobs on unrelated parallel machines to minimize the makespan. Recovering Beam Search is a recently introduced method for obtaining approximate solutions to combinatorial optimization problems. A traditional Beam Search algorithm is a type of truncated branch and bound algorithm approach. However, Recovering Beam Search allows the possibility of correcting wrong decisions by replacing partial solutions with others. We develop a Recovering Beam Search algorithm for our unrelated parallel machine scheduling problem that requires polynomial time. Computational results show that it is able to generate approximate solutions for instances with large size (up to 1000 jobs) using a few minutes of computation time.

Log In