Pages that link to "Item:Q3200872"

The following pages link to Minimizing Total Tardiness on One Machine is NP-Hard (Q3200872):

Displaying 50 items.

• Scheduling with time-dependent discrepancy times (Q1702735) (← links)
• Minimizing the number of late jobs when the start time of the machine is variable (Q1758276) (← links)
• A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times (Q1761176) (← links)
• Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818) (← links)
• Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints (Q1762106) (← links)
• A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop (Q1762116) (← links)
• A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine (Q1762139) (← links)
• A tabu search algorithm for parallel machine total tardiness problem (Q1765548) (← links)
• Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria (Q1767711) (← links)
• A possibilistic approach to sequencing problems with fuzzy parameters (Q1770715) (← links)
• On the single machine total tardiness problem (Q1771373) (← links)
• Single machine scheduling to minimize total weighted tardiness (Q1772846) (← links)
• Optimal and heuristic solutions for a scheduling problem arising in a foundry (Q1772868) (← links)
• Scheduling a single machine to minimize a regular objective function under setup constraints (Q1779690) (← links)
• On the complexity of the single machine scheduling problem minimizing total weighted delay penalty (Q1785249) (← links)
• Unary NP-hardness of minimizing total weighted tardiness with generalized due dates (Q1785477) (← links)
• An exact exponential branch-and-merge algorithm for the single machine total tardiness problem (Q1786599) (← links)
• Match-up scheduling under a machine breakdown (Q1806884) (← links)
• Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound (Q1847179) (← links)
• Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic (Q1848643) (← links)
• Finding the Pareto-optima for the total and maximum tardiness single machine problem (Q1850123) (← links)
• A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling (Q1885984) (← links)
• Scheduling two-machine preemptive open shops to minimize total completion time (Q1885987) (← links)
• Improving local search heuristics for some scheduling problems. I (Q1917263) (← links)
• On decomposition of the total tardiness problem (Q1924615) (← links)
• A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times (Q1928272) (← links)
• A special case of the single-machine total tardiness problem is NP-hard (Q1946412) (← links)
• New heuristics for total tardiness minimization in a flexible flowshop (Q1947616) (← links)
• Minimizing functions of infeasibilities in a two-machine flow shop (Q1969868) (← links)
• Minimizing delays in a shunting yard (Q2018111) (← links)
• Metaheuristics for a scheduling problem with rejection and tardiness penalties (Q2018941) (← links)
• \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← links)
• Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs (Q2029301) (← links)
• Minimizing total late work on a single machine with generalized due-dates (Q2030324) (← links)
• Large-scale storage/retrieval requests sorting algorithm for multi-I/O depots automated storage/retrieval systems (Q2039202) (← links)
• Metric approach for finding approximate solutions of scheduling problems (Q2048806) (← links)
• New results for scheduling to minimize tardiness on one machine with rejection and related problems (Q2061129) (← links)
• Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates (Q2066679) (← links)
• Mirror scheduling problems with early work and late work criteria (Q2066692) (← links)
• New formulations and solutions for the strategic berth template problem (Q2076915) (← links)
• On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates (Q2093185) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• Modeling and solving the waste valorization production and distribution scheduling problem (Q2106755) (← links)
• Minsum scheduling with acceptable lead-times and optional job rejection (Q2119760) (← links)
• Scheduling lower bounds via AND subset sum (Q2121467) (← links)
• Optimizing termination decision for meta-heuristic search techniques that converge to a static objective-value distribution (Q2125369) (← links)
• Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times (Q2140270) (← links)
• A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance (Q2147013) (← links)
• Single machine scheduling with rejection and generalized parameters (Q2149874) (← links)
• Risk-averse single machine scheduling: complexity and approximation (Q2286434) (← links)