The following pages link to (Q4034337):
Displayed 26 items.
- Optimal restricted due date assignment in scheduling (Q322834) (← 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)
- NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time (Q859949) (← 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)
- A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs (Q1278296) (← links)
- Single machine scheduling to minimize total weighted tardiness (Q1772846) (← 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)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- Scheduling with generalized and periodic due dates under single- and two-machine environments (Q2115317) (← 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)
- Approximation algorithms for minimizing the total weighted tardiness on a single machine (Q2368997) (← links)
- Single machine scheduling with controllable release and processing parameters (Q2433805) (← links)
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective (Q2465959) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
- Just-in-Time Scheduling with Equal-Size Jobs (Q2958671) (← links)
- Dual Techniques for Scheduling on a Machine with Varying Speed (Q3174696) (← links)
- Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals (Q4561184) (← links)
- Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates (Q5216799) (← links)
- A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time (Q5320231) (← links)
- An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates (Q5323068) (← links)
- Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty (Q6094564) (← links)