Pages that link to "Item:Q708332"

The following pages link to Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date (Q708332):

Displaying 11 items.

• Scheduling with time-dependent discrepancy times (Q1702735) (← links)
• On the complexity of the single machine scheduling problem minimizing total weighted delay penalty (Q1785249) (← links)
• Soft due window assignment and scheduling of unit-time jobs on parallel machines (Q1935552) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• New results for scheduling to minimize tardiness on one machine with rejection and related problems (Q2061129) (← links)
• Minsum scheduling with acceptable lead-times and optional job rejection (Q2119760) (← links)
• Scheduling jobs with a V-shaped time-dependent processing time (Q2215205) (← links)
• Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty (Q2336632) (← links)
• A note on ``Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date'' (Q2446866) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168) (← links)