Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
From MaRDI portal
Publication:4162941
DOI10.1287/opre.26.3.444zbMath0383.90054OpenAlexW2074191424MaRDI QIDQ4162941
Linus Schrage, Kenneth R. Baker
Publication date: 1978
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.26.3.444
Related Items (55)
A compact labelling scheme for series-parallel graphs ⋮ The stochastic single machine scheduling problem with earliness and tardiness costs ⋮ An algorithm to generate the ideals of a partial order ⋮ Scheduling two-machine preemptive open shops to minimize total completion time ⋮ A bicriterion scheduling problem involving total flowtime and total tardiness ⋮ Dynamic programming and decomposition approaches for the single machine total tardiness problem ⋮ Optimally balancing assembly lines with different workstations ⋮ An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations ⋮ Decomposition of the single machine total tardiness problem ⋮ The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective ⋮ The two-machine flowshop scheduling problem with total tardiness ⋮ Efficient generation of the ideals of a poset in Gray code order. II ⋮ New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives ⋮ Hybrid algorithm for sequencing with bicriteria ⋮ A controlled search simulated annealing method for the single machine weighted tardiness problem ⋮ Assembly line balancing as generalized bin packing ⋮ On the complexity of dynamic programming for sequencing problems with precedence constraints ⋮ Optimal scheduling of products with common and unique components ⋮ Two-machine flowshop scheduling to minimize total tardiness ⋮ Finding optimal line balances with OptPack ⋮ Minimizing total tardiness in a scheduling problem with a learning effect ⋮ Branch-and-bound algorithms for the multi-product assembly line balancing problem ⋮ Optimal partitions for shop floor control in semiconductor wafer fabrication ⋮ Precedence theorems and dynamic programming for the single-machine weighted tardiness problem ⋮ Exact and heuristic methods for solving the robotic assembly line balancing problem ⋮ Minimizing the weighted sum of squared tardiness on a single machine ⋮ Job Tardiness in Unequal Parallel Processor Systems ⋮ Scheduling preemptive open shops to minimize total tardiness ⋮ Single machine scheduling to minimize total weighted tardiness ⋮ An efficient network flow code for finding all minimum cost \(s-t\) cutsets ⋮ Efficient generation of the ideals of a poset in Gray code order ⋮ Minimizing tardiness in a two-machine flow-shop ⋮ A survey of algorithms for the single machine total weighted tardiness scheduling problem ⋮ Balancing assembly lines effectively -- a computational comparison ⋮ A neural network model for scheduling problems ⋮ The use of dynamic programming in genetic algorithms for permutation problems ⋮ Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure ⋮ Evaluation of leading heuristics for the single machine tardiness problem ⋮ A decomposition algorithm for the single machine total tardiness problem ⋮ State-of-the-art exact and heuristic solution procedures for simple assembly line balancing ⋮ A survey on problems and methods in generalized assembly line balancing ⋮ An linear programming based lower bound for the simple assembly line balancing problem ⋮ An optimal piecewise-linear program for the U-line balancing problem with stochastic task times ⋮ Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound ⋮ Moderate exponential-time algorithms for scheduling problems ⋮ Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem ⋮ A heuristic for the single machine tardiness problem ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ Characterization of all optimal solutions and parametric maximal mows in networks ⋮ A greedy heuristic for the mean tardiness sequencing problem ⋮ On the complexity of a family of generalized matching problems ⋮ Gray codes from antimatroids ⋮ Shortest-route formulation of mixed-model assembly line balancing problem ⋮ An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time ⋮ An exact algorithm for the precedence-constrained single-machine scheduling problem
This page was built for publication: Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
