Pages that link to "Item:Q1331548"

The following pages link to A dynamic programming method for single machine scheduling (Q1331548):

Displaying 21 items.

• Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
• The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation (Q322969) (← links)
• An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q339586) (← links)
• Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) (← links)
• Minmax scheduling with job-classes and earliness-tardiness costs (Q856255) (← links)
• The use of dynamic programming in genetic algorithms for permutation problems (Q1268271) (← links)
• Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642) (← links)
• Exact approaches for solving a covering problem with capacitated subtrees (Q1722966) (← links)
• An exact approach for scheduling jobs with regular step cost functions on a single machine (Q1762077) (← links)
• Single machine scheduling with symmetric earliness and tardiness penalties (Q1869413) (← links)
• Precedence theorems and dynamic programming for the single-machine weighted tardiness problem (Q1991104) (← links)
• An iterative dynamic programming approach for the temporal knapsack problem (Q2030285) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• An application of dynamic programming to assign pressing tanks at wineries (Q2189941) (← links)
• An exact algorithm for single-machine scheduling without machine idle time (Q2268522) (← links)
• Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms (Q2298093) (← links)
• An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← links)
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)
• Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date (Q2676340) (← links)
• An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem (Q2958666) (← links)
• An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems (Q5139849) (← links)