Pages that link to "Item:Q1038369"

The following pages link to The single-machine total tardiness scheduling problem: review and extensions (Q1038369):

Displaying 24 items.

• Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints (Q320637) (← links)
• A theoretical development for the total tardiness problem and its application in branch and bound algorithms (Q339575) (← links)
• An investigation on a two-agent single-machine scheduling problem with unequal release dates (Q339650) (← links)
• A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (Q497951) (← links)
• Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem (Q725705) (← links)
• On the flexibility of a decision theory-based heuristic for single machine scheduling (Q1628046) (← links)
• Lot-order assignment applying priority rules for the single-machine total tardiness scheduling with nonnegative time-dependent processing times (Q1665667) (← links)
• An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands (Q1666342) (← links)
• Distributionally robust single machine scheduling with risk aversion (Q1752194) (← links)
• An exact exponential branch-and-merge algorithm for the single machine total tardiness problem (Q1786599) (← links)
• \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• Scheduling jobs with normally distributed processing times on parallel machines (Q2242242) (← links)
• Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty (Q2286919) (← links)
• Modeling single machine preemptive scheduling problems for computational efficiency (Q2288995) (← links)
• Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints (Q2294600) (← links)
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
• A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs (Q2438422) (← links)
• Single-facility scheduling by logic-based Benders decomposition (Q2442086) (← links)
• The single-machine total tardiness problem with unequal release times and a linear deterioration (Q2511712) (← links)
• Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem (Q5111888) (← links)
• A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization (Q5131718) (← links)
• A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)
• Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness (Q6167662) (← links)