Pages that link to "Item:Q2368997"

The following pages link to Approximation algorithms for minimizing the total weighted tardiness on a single machine (Q2368997):

Displaying 30 items.

• Optimal restricted due date assignment in scheduling (Q322834) (← links)
• Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups (Q428876) (← links)
• A branch and bound algorithm to minimize total weighted tardiness on a single processor (Q596449) (← links)
• Algorithm for minimizing weighted earliness penalty in single-machine problem (Q706977) (← links)
• Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date (Q708332) (← links)
• Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments (Q708343) (← links)
• Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem (Q725705) (← links)
• New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
• A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date (Q861263) (← links)
• A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines (Q1040984) (← links)
• Non-approximability of just-in-time scheduling (Q1041346) (← links)
• On minimizing the sum of \(k\) tardinesses (Q1178234) (← links)
• On polynomial solvability of the high multiplicity total weighted tardiness problem (Q1208472) (← links)
• Energy-efficient bi-objective single-machine scheduling with power-down mechanism (Q1652365) (← links)
• Single machine scheduling to minimize total weighted tardiness (Q1772846) (← links)
• Algorithms for minimizing maximum lateness with unit length tasks and resource constraints (Q1803669) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• Precedence theorems and dynamic programming for the single-machine weighted tardiness problem (Q1991104) (← links)
• New results for scheduling to minimize tardiness on one machine with rejection and related problems (Q2061129) (← links)
• Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty (Q2336632) (← links)
• Approximation algorithms for scheduling problems with a modified total weighted tardiness objective (Q2465959) (← links)
• An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs (Q2628167) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work (Q4294731) (← links)
• A heuristic algorithm to minimize total weighted tardiness on a single machine with release times (Q4670675) (← links)
• STACS 2004 (Q5309698) (← links)
• An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates (Q5323068) (← links)
• New Precedence Theorems for One-Machine Weighted Tardiness (Q5388048) (← links)
• Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem (Q5892099) (← links)
• Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem (Q5920391) (← links)