Pages that link to "Item:Q1022445"
From MaRDI portal
The following pages link to Approximation algorithms for single machine scheduling with one unavailability period (Q1022445):
Displaying 10 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)
- 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 schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints (Q1799225) (← 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)
- 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)
