A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
From MaRDI portal
Cited in
(44)- A framework for the complexity of high-multiplicity scheduling problems
- Tradeoff between setup times and carrying costs for finished items
- The unit-capacity constrained permutation problem
- High-multiplicity \(N\)-fold IP via configuration LP
- The maximum deviation just-in-time scheduling problem.
- Single facility scheduling with multiple job classes
- Many Visits TSP Revisited
- Single machine scheduling to minimize the setup time and the earliness
- High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system
- A near-linear time algorithm and a min-cost flow approach for determining the optimal landing times of a fixed sequence of planes
- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times
- A dynamic programming approach for the aircraft landing problem with aircraft classes
- Aircraft landing problems with aircraft classes
- Local search procedures for improving feasible solutions to the sequential ordering problem
- Minimizing deviation from scheduled times in a single mixed-operation runway
- Lexicographic column generation with a tree search pricing algorithm
- Sequencing situations with just-in-time arrival, and related games
- An efficient genetic algorithm with uniform crossover for air traffic control
- 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
- On minimal Eulerian graphs
- Many-visits TSP revisited
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling
- The aircraft runway scheduling problem: a survey
- 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
- Enhanced models for a mixed arrival-departure aircraft sequencing problem
- 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
- Single facility scheduling with major and minor setups
- A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
- A heuristic approach for single-machine scheduling with due dates and class setups.
- Solving an unrelated parallel machines scheduling problem with machine- and job-dependent setups and precedence constraints considering support machines
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)
