Pages that link to "Item:Q1772973"

The following pages link to Preemptive scheduling with availability constraints to minimize total weighted completion times (Q1772973):

Displaying 30 items.

• Multitasking via alternate and shared processing: algorithms and complexity (Q284835) (← links)
• Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance (Q337029) (← links)
• A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504) (← links)
• Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933) (← links)
• Minimizing total completion time on a single machine with a flexible maintenance activity (Q613512) (← links)
• Single machine scheduling with semi-resumable machine availability constraints (Q655762) (← links)
• Solving an integrated job-shop problem with human resource constraints (Q744642) (← links)
• Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
• Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance (Q967809) (← links)
• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) (← links)
• Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337) (← links)
• Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times (Q1042030) (← links)
• Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval (Q1042105) (← links)
• An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness (Q1265894) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine (Q1961232) (← links)
• Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
• Single machine scheduling with non-availability interval and optional job rejection (Q2168742) (← links)
• Optimal algorithms for scheduling under time-of-use tariffs (Q2241552) (← links)
• Single-machine common due date total earliness/tardiness scheduling with machine unavailability (Q2286433) (← links)
• Modeling single machine preemptive scheduling problems for computational efficiency (Q2288995) (← links)
• Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance (Q2301137) (← links)
• Multi-coloring and job-scheduling with assignment and incompatibility costs (Q2449346) (← links)
• Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times (Q2456641) (← links)
• Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period (Q2467254) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• Optimal Algorithms and a PTAS for Cost-Aware Scheduling (Q2946391) (← links)
• Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs (Q3163792) (← links)
• Dual Techniques for Scheduling on a Machine with Varying Speed (Q3174696) (← links)
• Scheduling with cardinality dependent unavailability periods (Q6565385) (← links)