Pages that link to "Item:Q3313599"
From MaRDI portal
The following pages link to On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals (Q3313599):
Displaying 15 items.
- A note on ``Scheduling unit-time tasks with integer release times and deadlines'' (Q689642) (← links)
- Energy optimal schedules for jobs with multiple active intervals (Q844896) (← links)
- The complexity of scheduling independent two-processor tasks on dedicated processors (Q1107984) (← links)
- Scheduling jobs on a single machine with periodic release date/deadline intervals (Q1121168) (← links)
- Some results concerning the complexity of restricted colorings of graphs (Q1186161) (← links)
- Scheduling jobs with release times on a machine with finite storage (Q1330556) (← links)
- Interval vertex-coloring of a graph with forbidden colors (Q1823960) (← links)
- Job release scheduling problem: complexity and an approximation algorithm (Q1946231) (← links)
- Scheduling jobs with release and delivery times subject to nested eligibility constraints (Q2033983) (← links)
- Online scheduling of time-critical tasks to minimize the number of calibrations (Q2124226) (← links)
- Scheduling with a common due-window: polynomially solvable cases (Q2269806) (← links)
- Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
- Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties (Q2942667) (← links)
- Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines (Q3521921) (← links)
- An NC Algorithm for Scheduling Unit-Time Jobs with Arbitrary Release Times and Deadlines (Q4286236) (← links)
