Chris N. Potts

From MaRDI portal
Revision as of 10:24, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Chris N. Potts to Chris N. Potts: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:170009

Available identifiers

zbMath Open potts.chris-nMaRDI QIDQ170009

List of research outcomes

PublicationDate of PublicationType
Heuristic for vehicle routing problem with release and due dates2023-10-20Paper
Online production planning to maximize the number of on-time orders2021-05-05Paper
The Vehicle Routing Problem with Release and Due Dates2020-11-09Paper
Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables2018-05-30Paper
Dynamic scheduling of aircraft landings2018-02-16Paper
Split-merge: using exponential neighborhood search for scheduling a batching machine2016-11-17Paper
A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem2016-10-07Paper
Airport runway scheduling2013-08-08Paper
Rescheduling for Multiple New Orders2012-06-18Paper
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops2012-05-30Paper
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem2012-05-30Paper
Rescheduling for Job Unavailability2011-11-17Paper
Hamiltonian properties of locally connected graphs with bounded vertex degree2011-10-27Paper
Online Scheduling with Known Arrival Times2011-04-27Paper
Operator non-availability periods2009-12-02Paper
Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation2009-08-28Paper
Fifty years of scheduling: a survey of milestones2009-08-28Paper
Rescheduling for New Orders2009-07-10Paper
Supply Chain Scheduling: Batching and Delivery2009-07-09Paper
Scheduling with Fixed Delivery Dates2009-07-03Paper
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors2009-04-17Paper
Planning sustainable community health schemes in rural areas of developing countries2008-11-18Paper
Scheduling of coupled tasks and one-machine no-wait robotic cells2008-11-07Paper
Approximation results for flow shop scheduling problems with machine availability constraints2008-11-07Paper
Heuristics for a coupled-operation scheduling problem2008-07-11Paper
On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints2008-06-05Paper
A variable neighbourhood search algorithm for the constrained task allocation problem2008-05-09Paper
Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs2007-12-20Paper
The coordination of scheduling and batch deliveries2006-03-10Paper
Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time2005-11-11Paper
Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach2005-04-21Paper
Local search algorithms for the min-max loop layout problem2005-03-14Paper
Batching decisions for assembly production systems2005-01-12Paper
https://portal.mardi4nfdi.de/entity/Q48289822004-11-29Paper
Scheduling three-operation jobs in a two-machine flow shop to minimize makespan2004-08-10Paper
Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem2003-12-16Paper
On-line scheduling on a single machine: Maximizing the number of early jobs2002-09-03Paper
Scheduling with Finite Capacity Input Buffers2002-03-18Paper
Scheduling batches with simultaneous job processing for two-machine shop problems2002-02-27Paper
Workload balancing and loop layout in the design of a flexible manufacturing system2002-02-26Paper
Scheduling with Finite Capacity Output Buffers2002-02-07Paper
A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.2002-01-30Paper
Structural Properties of Lot Streaming in a Flow Shop2001-11-26Paper
Two-Machine No-Wait Flow Shop Scheduling with Missing Operations2001-11-26Paper
Parallel machine scheduling with a common server2001-11-21Paper
Scheduling with batching: A review2001-01-30Paper
A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups2000-11-22Paper
https://portal.mardi4nfdi.de/entity/Q42474602000-09-26Paper
Scheduling the production of two-component jobs on a single machine2000-03-19Paper
Scheduling multi-operation jobs on a single machine2000-01-11Paper
Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs2000-01-11Paper
Constraint satisfaction problems: Algorithms and applications1999-11-25Paper
A branch and bound algorithm for the two-stage assembly scheduling problem1999-10-06Paper
Approximation algorithms for two-machine flow shop scheduling with batch setup times1999-06-03Paper
Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time1999-03-07Paper
Scheduling a batching machine1999-01-11Paper
Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs1998-11-29Paper
Scheduling for a multifunction phased array radar system1998-10-07Paper
Single machine scheduling with batch set-up times to minimize maximum lateness1997-12-04Paper
Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time1997-12-04Paper
Preemptive scheduling with finite capacity input buffers1997-12-04Paper
https://portal.mardi4nfdi.de/entity/Q43651361997-10-30Paper
A New Heuristic for Three-Machine Flow Shop Scheduling1997-08-03Paper
Scheduling a two-stage hybrid flow shop with parallel machines at the first stage1997-06-16Paper
On the complexity of coupled-task scheduling1997-02-25Paper
Single Machine Scheduling to Minimize Total Weighted Late Work1996-10-20Paper
A comparison of local search methods for flow shop scheduling1996-07-28Paper
Lot streaming in three-stage production processes1995-11-09Paper
The Two-Stage Assembly Scheduling Problem: Complexity and Approximation1995-09-25Paper
Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs1995-07-17Paper
Unrelated parallel machine scheduling using local search1995-01-11Paper
A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work1994-11-17Paper
Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times1994-04-06Paper
Scheduling identical parallel machines to minimize total weighted completion time1994-03-24Paper
Single Machine Scheduling to Minimize Total Late Work1993-01-16Paper
Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity1993-01-16Paper
Approximation algorithms for scheduling a single machine to minimize total late work1992-12-17Paper
Scheduling with release dates on a single machine to minimize total weighted completion time1992-09-27Paper
Scheduling two job classes on a single machine1992-06-28Paper
Permutation vs. non-permutation flow shop schedules1992-06-27Paper
Heuristics for scheduling unrelated parallel machines1991-01-01Paper
A survey of algorithms for the single machine total weighted tardiness scheduling problem1990-01-01Paper
A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop1989-01-01Paper
On the Complexity of Scheduling with Batch Setup Times1989-01-01Paper
Dynamic Programming State-Space Relaxation for Single-Machine Scheduling1988-01-01Paper
Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs1988-01-01Paper
Dynamic programming and decomposition approaches for the single machine total tardiness problem1987-01-01Paper
Analysis of a linear programming heuristic for scheduling unrelated parallel machines1985-01-01Paper
A Branch and Bound Algorithm for the Total Weighted Tardiness Problem1985-01-01Paper
Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates1985-01-01Paper
A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time1985-01-01Paper
Algorithms for two-machine flow-shop sequencing with precedence constraints1984-01-01Paper
An algorithm for single machine sequencing with deadlines to minimize total weighted completion time1983-01-01Paper
An algorithm for single machine sequencing with release dates to minimize total weighted completion time1983-01-01Paper
A decomposition algorithm for the single machine total tardiness problem1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39163591981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39282331981-01-01Paper
An adaptive branching rule for the permutation flow-shop problem1980-01-01Paper
An algorithm for the single machine sequencing problem with precedence constraints1980-01-01Paper
Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times1980-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Chris N. Potts