Pages that link to "Item:Q1839195"

The following pages link to A fully polynomial approximation scheme for the total tardiness problem (Q1839195):

Displaying 26 items.

• A theoretical development for the total tardiness problem and its application in branch and bound algorithms (Q339575) (← links)
• Supply chain scheduling to minimize holding costs with outsourcing (Q490179) (← links)
• A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem (Q707153) (← links)
• Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem (Q732689) (← links)
• A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date (Q861263) (← links)
• A faster fully polynomial approximation scheme for the single-machine total tardiness problem (Q958114) (← links)
• The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
• A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines (Q1040984) (← links)
• Dynamic programming and decomposition approaches for the single machine total tardiness problem (Q1092805) (← links)
• Approximation algorithms for scheduling a single machine to minimize total late work (Q1196210) (← links)
• Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem (Q1197646) (← links)
• Parallel machine batching and scheduling with deadlines (Q1567300) (← links)
• Finding the Pareto-optima for the total and maximum tardiness single machine problem (Q1850123) (← links)
• Improving the complexities of approximation algorithms for optimization problems (Q1904613) (← links)
• Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs (Q2018942) (← links)
• Metric approach for finding approximate solutions of scheduling problems (Q2048806) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• The proportionate flow shop total tardiness problem (Q2178064) (← links)
• Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty (Q2336632) (← links)
• A metric for total tardiness minimization (Q2362385) (← links)
• Scheduling with monotonous earliness and tardiness penalties (Q2366084) (← links)
• Approximation algorithms for minimizing the total weighted tardiness on a single machine (Q2368997) (← links)
• Approximation algorithms for scheduling problems with a modified total weighted tardiness objective (Q2465959) (← links)
• Minimizing total tardiness in a scheduling problem with a learning effect (Q2466609) (← links)
• (Q5091246) (← links)
• An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates (Q5323068) (← links)