Pages that link to "Item:Q1022445"

The following pages link to Approximation algorithms for single machine scheduling with one unavailability period (Q1022445):

Displaying 18 items.

• A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization (Q298761) (← links)
• Semi-online scheduling on a single machine with unexpected breakdown (Q306274) (← links)
• Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval (Q326506) (← links)
• Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933) (← 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)
• Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
• Approximation algorithms for inventory constrained scheduling on a single machine (Q906561) (← links)
• Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints (Q1799225) (← links)
• A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times (Q1799381) (← links)
• An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints (Q1887763) (← links)
• An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown (Q2185825) (← links)
• Scheduling jobs and maintenance activities on parallel machines (Q2359536) (← links)
• Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint (Q2371343) (← links)
• (Q3372227) (← links)
• Online and semi-online scheduling to minimize makespan on single machine with an availability constraint (Q3451058) (← links)
• Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168) (← links)
• Online scheduling with deterioration and unexpected processor breakdown (Q6047192) (← links)
• Application of the interpolation approach for approximating single-machine scheduling problem with an unknown objective function (Q6169125) (← links)