Pages that link to "Item:Q1154384"

The following pages link to Fast approximation algorithm for job sequencing with deadlines (Q1154384):

Displaying 33 items.

• Improved algorithms for single machine scheduling with release dates and rejections (Q262445) (← links)
• An approximate binary search algorithm for the multiple-choice knapsack problem (Q293371) (← links)
• Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval (Q326506) (← links)
• An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem (Q398866) (← links)
• Fast approximation algorithms for routing problems with hop-wise constraints (Q490222) (← links)
• Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals (Q498410) (← links)
• Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates (Q640300) (← links)
• Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date (Q708332) (← links)
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries (Q763109) (← links)
• An optimization algorithm for the clearing of interbank payments (Q819066) (← links)
• Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
• Single processor scheduling with job values depending on their completion times (Q880588) (← links)
• An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs (Q898702) (← links)
• FPTAS for half-products minimization with scheduling applications (Q1005250) (← links)
• Approximation algorithms for single machine scheduling with one unavailability period (Q1022445) (← links)
• Approximation algorithms for scheduling a single machine to minimize total late work (Q1196210) (← links)
• Parallel machine batching and scheduling with deadlines (Q1567300) (← links)
• A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs (Q1667779) (← links)
• Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints (Q1799225) (← 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)
• Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains (Q2268520) (← links)
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains (Q2355078) (← links)
• Approximation schemes for scheduling a maintenance and linear deteriorating jobs (Q2358862) (← links)
• Approximation schemes for a class of subset selection problems (Q2381527) (← links)
• Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations (Q2398648) (← links)
• Improving the solution complexity of the scheduling problem with deadlines: A general technique (Q2954334) (← links)
• A dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 code (Q3002339) (← links)
• Approximate Deadline-Scheduling with Precedence Constraints (Q3452812) (← links)
• A Fast Approximation Algorithm For The Subset-Sum Problem (Q4313818) (← links)
• Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168) (← links)
• Single machine robust scheduling with budgeted uncertainty (Q6161900) (← links)
• Minimizing the maximum lateness for scheduling with release times and job rejection (Q6646743) (← links)