A Dynamic Programming Approach for Sequencing Groups of Identical Jobs

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Operations research and management science (90B99)

Cited In (42)

A framework for the complexity of high-multiplicity scheduling problems
Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem
Tradeoff between setup times and carrying costs for finished items
High-multiplicity \(N\)-fold IP via configuration LP
The unit-capacity constrained permutation problem
Many Visits TSP Revisited
The maximum deviation just-in-time scheduling problem.
Single facility scheduling with multiple job classes
Single machine scheduling to minimize the setup time and the earliness
Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times
High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system
A dynamic programming approach for the aircraft landing problem with aircraft classes
Aircraft landing problems with aircraft classes
Minimizing deviation from scheduled times in a single mixed-operation runway
Local search procedures for improving feasible solutions to the sequential ordering problem
An efficient genetic algorithm with uniform crossover for air traffic control
Sequencing situations with just-in-time arrival, and related games
Low-complexity algorithms for sequencing jobs with a fixed number of job-classes
Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
Dynamic scheduling of aircraft landings
MIP modelling of changeovers in production planning and scheduling problems
Scheduling models for air traffic control in terminal areas
New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints
An optimal data-splitting algorithm for aircraft sequencing on a single runway
Many-visits TSP revisited
On minimal Eulerian graphs
The aircraft runway scheduling problem: a survey
Exact and approximate algorithms for high-multiplicity parallel machine scheduling
A 3/2-Approximation for the Metric Many-Visits Path TSP
Lessons from building an automated pre-departure sequencer for airports
Methods for solving of the aircraft landing problem. I: Exact solution methods
Single facility multi-class job scheduling
Parallel machine scheduling with preference of machines
Batch scheduling to minimize total completion time
Solving the time-discrete winter runway scheduling problem: a column generation and constraint programming approach
An efficient ant colony algorithm based on wake-vortex modeling method for aircraft scheduling problem
A polynomial algorithm for an integer quadratic non-separable transportation problem
Airport runway scheduling
A heuristic approach for single-machine scheduling with due dates and class setups.
Single facility scheduling with major and minor setups
Solving an unrelated parallel machines scheduling problem with machine- and job-dependent setups and precedence constraints considering support machines
A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse

This page was built for publication: A Dynamic Programming Approach for Sequencing Groups of Identical Jobs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3893643)