Pages that link to "Item:Q3682221"

The following pages link to A Branch and Bound Algorithm for the Total Weighted Tardiness Problem (Q3682221):

Displaying 50 items.

• Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
• A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times (Q337074) (← links)
• Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity (Q339549) (← links)
• New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
• A GRASP based on DE to solve single machine scheduling problem with SDST (Q434179) (← links)
• Column generation for extended formulations (Q458128) (← links)
• Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) (← links)
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) (← links)
• Single machine scheduling with flow time and earliness penalties (Q686991) (← links)
• A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem (Q707153) (← links)
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment (Q709154) (← links)
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
• A tabu search algorithm for the single machine total weighted tardiness problem (Q853020) (← links)
• Scheduling on parallel identical machines to minimize total tardiness (Q856206) (← links)
• A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date (Q861263) (← links)
• Two due date assignment problems in scheduling a single machine (Q867932) (← links)
• Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling (Q875408) (← links)
• A controlled search simulated annealing method for the single machine weighted tardiness problem (Q918386) (← links)
• FMS scheduling based on timed Petri net model and reactive graph search (Q937986) (← links)
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311) (← links)
• A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times (Q1000975) (← links)
• A population-based variable neighborhood search for the single machine total weighted tardiness problem (Q1001005) (← links)
• Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization (Q1041924) (← links)
• The one machine scheduling problem: insertion of a job under the real-time constraint (Q1042209) (← links)
• Real-time scheduling of an automated manufacturing center (Q1116883) (← links)
• A survey of algorithms for the single machine total weighted tardiness scheduling problem (Q1262207) (← links)
• The use of dynamic programming in genetic algorithms for permutation problems (Q1268271) (← links)
• Scheduling jobs on parallel machines with sequence-dependent setup times (Q1278125) (← links)
• Single machine earliness and tardiness scheduling (Q1278531) (← links)
• A branch and bound algorithm for the two-stage assembly scheduling problem (Q1280185) (← links)
• Cellular control of manufacturing systems (Q1309976) (← links)
• Scheduling identical parallel machines to minimize total weighted completion time (Q1317043) (← links)
• A dynamic programming method for single machine scheduling (Q1331548) (← links)
• Scheduling parallel machines to minimize total weighted and unweighted tardiness (Q1370670) (← links)
• A new lower bounding scheme for the total weighted tardiness problem. (Q1406617) (← links)
• A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach (Q1699353) (← links)
• Minimizing the weighted sum of squared tardiness on a single machine (Q1762060) (← links)
• Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem (Q1762096) (← links)
• A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine (Q1762139) (← links)
• Single machine scheduling to minimize total weighted tardiness (Q1772846) (← links)
• A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness (Q1793450) (← links)
• Improving the performance of enumerative search methods. I: Exploiting structure and intelligence (Q1892667) (← links)
• Precedence theorems and dynamic programming for the single-machine weighted tardiness problem (Q1991104) (← links)
• Metaheuristics for a scheduling problem with rejection and tardiness penalties (Q2018941) (← links)
• Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times (Q2124913) (← links)
• An exact approach for the personnel task rescheduling problem with task retiming (Q2242295) (← links)
• An exact algorithm for single-machine scheduling without machine idle time (Q2268522) (← links)
• Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty (Q2286919) (← links)
• An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← links)
• The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies (Q2356207) (← links)