Dynamic Programming State-Space Relaxation for Single-Machine Scheduling

DOI10.1057/JORS.1988.26MaRDI QIDQ3802870zbMATH OpenOpenAlexFDO

Authors T. S. Abdul-Razaq, Chris N. Potts

Publication date 1988

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1988.26

zbMATH Keywords

lower boundpenaltiesdeterministic single machine schedulingoptimality recursionsstate-space modifiers

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• A dynamic programming method for single machine scheduling
• scientific article; zbMATH DE number 2086966
• A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem
• A dynamic programming algorithm for single machine scheduling with ready times
• scientific article; zbMATH DE number 49601

Cited in

(44)

• A branch and bound approach for single machine scheduling with earliness and tardiness penalties
• Scheduling just-in-time part supply for mixed-model assembly lines
• EA/G-GA for single machine scheduling problems with earliness/tardiness costs
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
• Nodal aggregation of resource constraints in a shortest path problem
• Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems
• Minimizing earliness and tardiness costs in stochastic scheduling
• Minmax scheduling with job-classes and earliness-tardiness costs
• Single-machine scheduling with time windows and earliness/tardiness penalties
• An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
• On the Bellman's principle of optimality
• An exact approach to early/tardy scheduling with release dates
• A time indexed formulation of non-preemptive single machine scheduling problems
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
• Single machine scheduling with symmetric earliness and tardiness penalties
• A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
• Improved heuristics for the early/tardy scheduling problem with no idle time
• 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
• A composite heuristic for the single machine early/tardy job scheduling problem.
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• Minimizing the weighted number of tardy jobs on a single machine with release dates
• Discovering heuristics with large language models (LLMs) for mixed-integer programs: single-machine scheduling
• scientific article; zbMATH DE number 2086966 (Why is no real title available?)
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• An exact algorithm for single-machine scheduling without machine idle time
• Exact solution procedures for the balanced unidirectional cyclic layout problem
• A dynamic programming method for single machine scheduling
• A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties
• A comparison of lower bounds for the single-machine early/tardy problem
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
• An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
• Single machine earliness and tardiness scheduling
• Minimizing the earliness--tardiness costs on a single machine
• The stochastic single machine scheduling problem with earliness and tardiness costs
• An exact approach for scheduling jobs with regular step cost functions on a single machine
• Using short-term memory to minimize the weighted number of late jobs on a single machine.
• 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
• An exact algorithm for the precedence-constrained single-machine scheduling problem
• Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
• Dynamic scheduling in manufacturing systems using Brownian approximations

This page was built for publication: Dynamic Programming State-Space Relaxation for Single-Machine Scheduling

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