Pages that link to "Item:Q3993992"

The following pages link to A branch-and-bound algorithm to minimize total tardiness with different release dates (Q3993992):

Displaying 44 items.

• A mixed integer programming approach for the single machine problem with unequal release dates (Q337161) (← 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)
• A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates (Q596267) (← links)
• Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates (Q632665) (← links)
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
• A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (Q842556) (← links)
• Scheduling on parallel identical machines to minimize total tardiness (Q856206) (← links)
• A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems (Q858325) (← links)
• An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem (Q875429) (← links)
• An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness (Q880552) (← links)
• A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (Q941541) (← links)
• Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness (Q1038111) (← links)
• The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
• Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function (Q1129910) (← links)
• The two-machine total completion time flow shop problem (Q1266536) (← links)
• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications (Q1348546) (← links)
• Decomposition of the single machine total tardiness problem (Q1362989) (← links)
• Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. (Q1413906) (← links)
• Scheduling a single machine to minimize a regular objective function under setup constraints (Q1779690) (← links)
• An exact approach to early/tardy scheduling with release dates (Q1781563) (← links)
• A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness (Q1793450) (← links)
• Match-up scheduling under a machine breakdown (Q1806884) (← links)
• A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685) (← links)
• A scheduling problem to minimize total weighted tardiness in the two-stage assembly flowshop (Q2004254) (← links)
• A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance (Q2147013) (← links)
• Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times (Q2290196) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• Dominance-based heuristics for one-machine total cost scheduling problems (Q2384840) (← links)
• Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports (Q2398778) (← links)
• Single-machine scheduling with no idle time and release dates to~minimize a regular criterion (Q2434281) (← links)
• A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property (Q2456645) (← links)
• Minimizing total tardiness on a single machine with unequal release dates (Q2462144) (← links)
• A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times (Q2572851) (← links)
• Scheduling on parallel machines to minimise maximum lateness for the customer order problem (Q2873094) (← links)
• Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions (Q3166272) (← links)
• Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm (Q3430246) (← links)
• (Q4017560) (← links)
• Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption (Q4909020) (← links)
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (Q5187929) (← links)
• Minimizing total tardiness in an unrelated parallel-machine scheduling problem (Q5428943) (← links)
• Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date (Q5939594) (← links)
• A new dominance rule to minimize total weighted tardiness with unequal release dates. (Q5952443) (← links)
• Model buidling for air-traffic controllers' workload regulation (Q5953327) (← links)