Search Results - "Potts, C N"

Fifty Years of Scheduling: A Survey of Milestones by Potts, C. N., Strusevich, V. A.

“…Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical…”
Get full text

Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach by Ghirardi, M., Potts, C.N.

“…This paper considers the problem of scheduling jobs on unrelated parallel machines to minimize the makespan. Recovering Beam Search is a recently introduced…”
Get full text

Bicriteria efficiency/equity hierarchical location models for public service application by Smith, H K, Harper, P R, Potts, C N

“…As is often the case in healthcare provision, public services may offer facilities at a hierarchy of levels in different locations, ranging from basic to…”
Get full text

Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation by Gordon, V. S., Potts, C. N., Strusevich, V. A., Whitehead, J. D.

“…We consider various single machine scheduling problems in which the processing time of a job depends either on its position in a processing sequence or on its…”
Get full text

A variable neighbourhood search algorithm for the constrained task allocation problem by Lusa, A, Potts, C N

“…A variable neighbourhood search algorithm that employs new neighbourhoods is proposed for solving a task allocation problem whose main characteristics are: (i)…”
Get full text

Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables by Penn, M.L., Potts, C.N., Harper, P.R.

“…•Developing a model for creating master operating theatre timetables that include multiple factors.•Smoothing of expected bed usage, taking account of…”
Get full text

A branch and bound algorithm for the two-stage assembly scheduling problem by HARIRI, A. M. A, POTTS, C. N

“…A branch and bound algorithm is developed for the 2-stage assembly scheduling problem. In this problem, there are m machines at the first stage, each of which…”
Get full text

The Two-Stage Assembly Scheduling Problem: Complexity and Approximation by Potts, C. N, Sevast'janov, S. V, Strusevich, V. A, Van Wassenhove, L. N, Zwaneveld, C. M

“…This paper introduces a new two-stage assembly scheduling problem. There are m machines at the first stage, each of which produces a component of a job. When…”
Get full text

Batching decisions for assembly production systems by Kovalyov, M.Y., Potts, C.N., Strusevich, V.A.

“…The two-stage assembly scheduling problem is a model for production processes that involve the assembly of final or intermediate products from basic…”
Get full text

Workload balancing and loop layout in the design of a flexible manufacturing system by Potts, C.N., Whitehead, J.D.

“…This paper considers combined scheduling and machine layout problems in a flexible manufacturing system (FMS). All machines have the capability of performing…”
Get full text

Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity by Potts, C. N., Wassenhove, L. N. Van

“…In many practical situations, batching of similar jobs to avoid set-ups is performed whilst constructing a schedule. On the other hand, each job may consist of…”
Get full text

Scheduling for a multifunction phased array radar system by Orman, A.J., Potts, C.N., Shahani, A.K., Moore, A.R.

“…A multifunction radar is a new, complex, radar system which combines the previously isolated tasks of searching volumes of space, tracking targets and guiding…”
Get full text

Structural Properties of Lot Streaming in a Flow Shop by Glass, C. A, Potts, C. N

“…Lot streaming is the process of splitting a given lot or job to allow the overlapping of successive operations in multi-stage production systems, thereby…”
Get full text

Single Machine Scheduling to Minimize Total Late Work by Potts, C. N, Van Wassenhove, L. N

“…In the problem of scheduling a single machine to minimize total late work, there are n jobs to be processed for which each has an integer processing time and a…”
Get full text

Two-Machine No-Wait Flow Shop Scheduling with Missing Operations by Glass, C. A, Gupta, J. N. D, Potts, C. N

“…This paper considers the no-wait scheduling of n jobs in a two-machine flow shop, where some jobs require processing on the first machine only. The objective…”
Get full text

Heuristics for a coupled-operation scheduling problem by Potts, C N, Whitehead, J D

“…In this paper, we study a strongly NP-hard single machine scheduling problem in which each job consists of two operations that are separated by a time delay…”
Get full text

Local search algorithms for the min-max loop layout problem by Bennell, J A, Potts, C N, Whitehead, J D

“…In the min-max loop layout problem, machines are to be arranged around a loop of conveyor belt. The ordering of the machines dictates the number of circuits of…”
Get full text

Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs by Crauwels, H.A.J., Potts, C.N., Van Wassenhove, L.N.

“…Local search heuristics are developed for a problem of scheduling jobs on a single machine. Jobs are partitioned into families, and a set-up time is necessary…”
Get full text

Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs by Crauwels, H. A. J., Potts, C. N., Oudheusden, D. Van, Van Wassenhove, L. N.

“…This paper considers the problem of scheduling a single machine to minimize the number of late jobs in the presence of sequence-independent family set-up…”
Get full text

Scheduling of coupled tasks with unit processing times by Blazewicz, J., Ecker, K., Kis, T., Potts, C. N., Tanas, M., Whitehead, J.

“…The coupled tasks scheduling problem was originally introduced for modeling complex radar devices. It is still used for controlling such devices and applied in…”
Get full text