Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
From MaRDI portal
Cited in
(58)- On the complexity of a family of generalized matching problems
- A compact labelling scheme for series-parallel graphs
- An algorithm to generate the ideals of a partial order
- Dynamic programming and decomposition approaches for the single machine total tardiness problem
- The two-machine flowshop scheduling problem with total tardiness
- Hybrid algorithm for sequencing with bicriteria
- Assembly line balancing as generalized bin packing
- Finding optimal line balances with OptPack
- Branch-and-bound algorithms for the multi-product assembly line balancing problem
- Optimal partitions for shop floor control in semiconductor wafer fabrication
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- 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 heuristic for the single machine tardiness problem
- A greedy heuristic for the mean tardiness sequencing problem
- Gray codes from antimatroids
- The stochastic single machine scheduling problem with earliness and tardiness costs
- Optimally balancing assembly lines with different workstations
- Decomposition of the single machine total tardiness problem
- Shortest-route formulation of mixed-model assembly line balancing problem
- Exact and heuristic methods for solving the robotic assembly line balancing problem
- Minimizing the weighted sum of squared tardiness on a single machine
- Single machine scheduling to minimize total weighted tardiness
- Balancing assembly lines effectively -- a computational comparison
- A decomposition algorithm for the single machine total tardiness problem
- Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound
- Scheduling two-machine preemptive open shops to minimize total completion time
- Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
- Moderate exponential-time algorithms for scheduling problems
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- 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
- New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives
- Minimizing total tardiness in a scheduling problem with a learning effect
- 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
- Job Tardiness in Unequal Parallel Processor Systems
- An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
- Characterization of all optimal solutions and parametric maximal mows in networks
- Efficient generation of the ideals of a poset in Gray code order. II
- A bicriterion scheduling problem involving total flowtime and total tardiness
- Two-machine flowshop scheduling to minimize total tardiness
- Optimal scheduling of products with common and unique components
- An efficient network flow code for finding all minimum cost \(s-t\) cutsets
- Minimizing tardiness in a two-machine flow-shop
- Precedence-constrained shortest path
- An efficient hybridization of ant colony optimization and genetic algorithm for an assembly line balancing problem of type II under zoning constraints
- Moderate exponential-time algorithms for scheduling problems
- Scheduling preemptive open shops to minimize total tardiness
- A controlled search simulated annealing method for the single machine weighted tardiness problem
- On the complexity of dynamic programming for sequencing problems with precedence constraints
- Efficient generation of the ideals of a poset in Gray code order
This page was built for publication: Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4162941)
