Pages that link to "Item:Q3802870"
From MaRDI portal
The following pages link to Dynamic Programming State-Space Relaxation for Single-Machine Scheduling (Q3802870):
Displaying 42 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)
- EA/G-GA for single machine scheduling problems with earliness/tardiness costs (Q400876) (← links)
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) (← links)
- Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems (Q613776) (← links)
- A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties (Q838299) (← links)
- Minimizing the weighted number of tardy jobs on a single machine with release dates (Q852934) (← links)
- Minmax scheduling with job-classes and earliness-tardiness costs (Q856255) (← links)
- A comparison of lower bounds for the single-machine early/tardy problem (Q868992) (← links)
- Minimizing total earliness and tardiness on a single machine using a hybrid heuristic (Q878591) (← links)
- A time indexed formulation of non-preemptive single machine scheduling problems (Q1196724) (← links)
- A survey of algorithms for the single machine total weighted tardiness scheduling problem (Q1262207) (← links)
- Single-machine scheduling with time windows and earliness/tardiness penalties (Q1278201) (← links)
- Single machine earliness and tardiness scheduling (Q1278531) (← links)
- A dynamic programming method for single machine scheduling (Q1331548) (← links)
- The stochastic single machine scheduling problem with earliness and tardiness costs (Q1333461) (← links)
- A composite heuristic for the single machine early/tardy job scheduling problem. (Q1406666) (← links)
- On the Bellman's principle of optimality (Q1619876) (← links)
- An exact approach for scheduling jobs with regular step cost functions on a single machine (Q1762077) (← links)
- An exact approach to early/tardy scheduling with release dates (Q1781563) (← links)
- Using short-term memory to minimize the weighted number of late jobs on a single machine. (Q1812007) (← links)
- Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties (Q1848363) (← links)
- Single machine scheduling with symmetric earliness and tardiness penalties (Q1869413) (← links)
- Improved heuristics for the early/tardy scheduling problem with no idle time (Q1886859) (← links)
- A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights (Q1906942) (← links)
- A branch and bound approach for single machine scheduling with earliness and tardiness penalties (Q1963033) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- An exact algorithm for single-machine scheduling without machine idle time (Q2268522) (← links)
- Scheduling just-in-time part supply for mixed-model assembly lines (Q2275595) (← links)
- Algorithms for a class of single-machine weighted tardiness and earliness problems (Q2277355) (← links)
- An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← links)
- Minimizing earliness and tardiness costs in stochastic scheduling (Q2356252) (← links)
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)
- Exact solution procedures for the balanced unidirectional cyclic layout problem (Q2482739) (← links)
- Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties (Q2483517) (← links)
- Nodal aggregation of resource constraints in a shortest path problem (Q2490165) (← links)
- Minimizing the earliness--tardiness costs on a single machine (Q2499156) (← links)
- A branch and bound procedure to minimize mean absolute lateness on a single processor (Q2563889) (← 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)
- A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM (Q5487850) (← links)
- Dynamic scheduling in manufacturing systems using Brownian approximations (Q5955769) (← links)
