Pages that link to "Item:Q1838035"
From MaRDI portal
The following pages link to Scheduling unit-time tasks with integer release times and deadlines (Q1838035):
Displaying 18 items.
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- Feasibility analysis under fixed priority scheduling with limited preemptions (Q554013) (← links)
- A note on ``Scheduling unit-time tasks with integer release times and deadlines'' (Q689642) (← links)
- About one algorithm for solving scheduling problem (Q748247) (← links)
- Efficient algorithms for robustness in resource allocation and scheduling problems (Q818137) (← links)
- Probabilistic single processor scheduling (Q912611) (← links)
- Jackson's semi-preemptive scheduling on a single machine (Q991363) (← links)
- A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
- Some results concerning the complexity of restricted colorings of graphs (Q1186161) (← links)
- Open shop problem with zero-one time operations and integer release date/deadline intervals (Q1363753) (← links)
- Interval vertex-coloring of a graph with forbidden colors (Q1823960) (← links)
- An efficient algorithm for a job shop problem (Q1897385) (← links)
- A linear time algorithm for maximum matchings in convex, bipartite graphs (Q1921260) (← links)
- Minimizing variation of production rates in just-in-time systems: A survey (Q2367376) (← links)
- Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity (Q2434311) (← links)
- Stochastic scheduling to minimize expected maximum lateness (Q2482822) (← links)
- Decision Incorporation in Meta-heuristics to Cope with Decision Scheduling Problems (Q2866131) (← links)