A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
From MaRDI portal
Publication:3893643
DOI10.1287/opre.28.6.1347zbMath0447.90040OpenAlexW2042706779MaRDI QIDQ3893643
Publication date: 1980
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.28.6.1347
computational complexitysingle machineaircraft managementaircraft landingssequencing groups of identical jobstotal processing time minimization
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Operations research and management science (90B99)
Related Items
Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times, Parallel machine scheduling with preference of machines, Batch scheduling to minimize total completion time, A 3/2-Approximation for the Metric Many-Visits Path TSP, A dynamic programming approach for the aircraft landing problem with aircraft classes, Single facility scheduling with multiple job classes, Minimizing deviation from scheduled times in a single mixed-operation runway, Airport runway scheduling, Lessons from building an automated pre-departure sequencer for airports, Single facility scheduling with major and minor setups, Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem, Scheduling models for air traffic control in terminal areas, The aircraft runway scheduling problem: a survey, Aircraft landing problems with aircraft classes, High-multiplicity \(N\)-fold IP via configuration LP, Dynamic scheduling of aircraft landings, On minimal Eulerian graphs, Single facility multi-class job scheduling, The maximum deviation just-in-time scheduling problem., Sequencing situations with just-in-time arrival, and related games, Many Visits TSP Revisited, Lower bounds and algorithms for flowtime minimization on a single machine with set-up times, An efficient genetic algorithm with uniform crossover for air traffic control, 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, The unit-capacity constrained permutation problem, Tradeoff between setup times and carrying costs for finished items, A heuristic approach for single-machine scheduling with due dates and class setups., High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system, A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse, Many-visits TSP revisited, MIP modelling of changeovers in production planning and scheduling problems, An optimal data-splitting algorithm for aircraft sequencing on a single runway, Solving the time-discrete winter runway scheduling problem: a column generation and constraint programming approach, Single machine scheduling to minimize the setup time and the earliness, New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints, Exact and approximate algorithms for high-multiplicity parallel machine scheduling, Low-complexity algorithms for sequencing jobs with a fixed number of job-classes, Methods for solving of the aircraft landing problem. I: Exact solution methods, A framework for the complexity of high-multiplicity scheduling problems, Local search procedures for improving feasible solutions to the sequential ordering problem
