Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
From MaRDI portal
Publication:3802870
DOI10.1057/jors.1988.26zbMath0655.90034OpenAlexW2023697546MaRDI QIDQ3802870
T. S. Abdul-Razaq, Chris N. Potts
Publication date: 1988
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1988.26
lower boundpenaltiesdeterministic single machine schedulingoptimality recursionsstate-space modifiers
Related Items
A dynamic programming method for single machine scheduling, On the Bellman's principle of optimality, The stochastic single machine scheduling problem with earliness and tardiness costs, Improved heuristics for the early/tardy scheduling problem with no idle time, A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties, Exact algorithms for single-machine scheduling with time windows and precedence constraints, The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation, Minimizing the weighted number of tardy jobs on a single machine with release dates, Minmax scheduling with job-classes and earliness-tardiness costs, A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights, A comparison of lower bounds for the single-machine early/tardy problem, Minimizing total earliness and tardiness on a single machine using a hybrid heuristic, Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems, EA/G-GA for single machine scheduling problems with earliness/tardiness costs, An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem, A composite heuristic for the single machine early/tardy job scheduling problem., A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time, A branch and bound approach for single machine scheduling with earliness and tardiness penalties, An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems, Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems, A time indexed formulation of non-preemptive single machine scheduling problems, Exact solution procedures for the balanced unidirectional cyclic layout problem, Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties, An exact approach for scheduling jobs with regular step cost functions on a single machine, Nodal aggregation of resource constraints in a shortest path problem, An exact algorithm for single-machine scheduling without machine idle time, Minimizing the earliness--tardiness costs on a single machine, Scheduling just-in-time part supply for mixed-model assembly lines, An exact approach to early/tardy scheduling with release dates, Algorithms for a class of single-machine weighted tardiness and earliness problems, Dynamic scheduling in manufacturing systems using Brownian approximations, A survey of algorithms for the single machine total weighted tardiness scheduling problem, Using short-term memory to minimize the weighted number of late jobs on a single machine., Single-machine scheduling with time windows and earliness/tardiness penalties, Single machine earliness and tardiness scheduling, A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM, A branch and bound procedure to minimize mean absolute lateness on a single processor, Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems, Single machine scheduling with symmetric earliness and tardiness penalties, An exact algorithm for the precedence-constrained single-machine scheduling problem, Minimizing earliness and tardiness costs in stochastic scheduling
