Pages that link to "Item:Q2434288"

The following pages link to A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288):

Displaying 24 items.

• Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem (Q282252) (← links)
• Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
• A hybrid heuristic approach for single machine scheduling with release times (Q336949) (← 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)
• A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem (Q622145) (← links)
• Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times (Q1652516) (← links)
• An exact algorithm for the bi-objective timing problem (Q1653286) (← links)
• \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← links)
• Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers (Q2077972) (← links)
• Order assignment and scheduling under processing and distribution time uncertainty (Q2083940) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times (Q2102999) (← links)
• Minimizing makespan on a single machine with release dates and inventory constraints (Q2184096) (← links)
• On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
• A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints (Q2256319) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← links)
• Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time (Q2664351) (← links)
• On the mass COVID-19 vaccination scheduling problem (Q2669767) (← links)
• Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date (Q2676340) (← links)
• A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems (Q2806861) (← 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)