Pages that link to "Item:Q642981"

The following pages link to Approximation schemes for parallel machine scheduling with availability constraints (Q642981):

Displaying 17 items.

• A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
• Minimizing total weighted completion time with an unexpected machine unavailable interval (Q398911) (← links)
• Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933) (← links)
• Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals (Q498410) (← links)
• Makespan minimization for parallel machines scheduling with multiple availability constraints (Q744645) (← links)
• Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337) (← links)
• Machine scheduling with availability constraints (Q1284696) (← links)
• Simultaneous scheduling of production and preventive maintenance on a single machine (Q1640459) (← links)
• Optimal parallel machines scheduling with availability constraints (Q1775061) (← links)
• Approximation schemes for parallel machine scheduling problems with controllable processing times (Q1885962) (← links)
• Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location (Q2659777) (← links)
• (Q3180917) (← links)
• A fully polynomial time approximation scheme for makespan minimization problems on two machines with a fixed non-availability interval (Q4901463) (← links)
• (Q5260122) (← links)
• Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems (Q5470732) (← links)
• Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods (Q6090983) (← links)
• The parallel AGV scheduling problem with battery constraints: a new formulation and a matheuristic approach (Q6109805) (← links)