Pages that link to "Item:Q4153908"

The following pages link to Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks (Q4153908):

Displaying 22 items.

• A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem (Q582208) (← links)
• Real-time scheduling of an automated manufacturing center (Q1116883) (← links)
• Scheduling algorithms based on necessary optimality conditions (Q1116885) (← links)
• Hybrid algorithm for sequencing with bicriteria (Q1162274) (← links)
• The stochastic single machine scheduling problem with earliness and tardiness costs (Q1333461) (← links)
• Decomposition of the single machine total tardiness problem (Q1362989) (← links)
• Solution of the single machine total tardiness problem (Q1592283) (← links)
• A decomposition algorithm for the single machine total tardiness problem (Q1838424) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• Single machine scheduling with nonlinear cost functions (Q2277133) (← links)
• An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← links)
• Minimizing total tardiness in a scheduling problem with a learning effect (Q2466609) (← links)
• A branch and bound procedure to minimize mean absolute lateness on a single processor (Q2563889) (← links)
• One-Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons (Q2875603) (← links)
• Analysis of a linearization heuristic for single-machine scheduling to maximize profit (Q3313596) (← links)
• A survey and evaluation of static flowshop scheduling heuristics (Q3329204) (← links)
• Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem (Q3430248) (← links)
• Production problems with deadline penalties (Q3738897) (← links)
• Two-machine flowshop scheduling to minimize total tardiness (Q4352599) (← links)
• Scheduling with tails and deadlines (Q5937434) (← links)
• Dynamic scheduling in manufacturing systems using Brownian approximations (Q5955769) (← links)
• Minimizing tardiness in a two-machine flow-shop (Q5959377) (← links)