Pages that link to "Item:Q3925879"
From MaRDI portal
The following pages link to Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines (Q3925879):
Displaying 40 items.
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
- Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time (Q391321) (← links)
- A study of single-machine scheduling problem to maximize throughput (Q398860) (← links)
- Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem (Q490323) (← links)
- Feasibility analysis under fixed priority scheduling with limited preemptions (Q554013) (← links)
- Parallel batch scheduling of equal-length jobs with release and due dates (Q600846) (← links)
- Preemptive scheduling of equal-length jobs in polynomial time (Q626963) (← links)
- A note on ``Scheduling unit-time tasks with integer release times and deadlines'' (Q689642) (← links)
- Effective optimization methods for single-machine scheduling (survey) (Q786645) (← links)
- New directions in scheduling theory (Q786649) (← links)
- The feasibility of general task systems with precedence constraints on multiprocessor platforms (Q842732) (← links)
- Arc-B-consistency of the inter-distance constraint (Q879973) (← links)
- A note on scheduling equal-length jobs to maximize throughput (Q880531) (← links)
- Probabilistic single processor scheduling (Q912611) (← links)
- Jackson's semi-preemptive scheduling on a single machine (Q991363) (← links)
- Handling mixed sets of tasks in combined offline and online scheduled real-time systems (Q1033678) (← links)
- Efficient scheduling algorithms for a single batch processing machine (Q1077325) (← links)
- A procedure for the one-machine sequencing problem with dependent jobs (Q1130073) (← links)
- Interval edge coloring of a graph with forbidden colors (Q1309462) (← links)
- One machine scheduling problem with fuzzy duedates (Q1342032) (← links)
- On minimizing the weighted number of late jobs in unit execution time open-shops. (Q1399578) (← links)
- Scheduling equal-length jobs on identical parallel machines (Q1570817) (← links)
- Theoretical expectation versus practical performance of Jackson's heuristic (Q1665791) (← links)
- Dispersing points on intervals (Q1706121) (← links)
- Scheduling unit-time tasks with integer release times and deadlines (Q1838035) (← links)
- Scheduling jobs of equal length: Complexity, facets and computational results (Q1919094) (← links)
- Ideal schedules in parallel machine settings (Q2029359) (← links)
- Theoretical and practical issues in single-machine scheduling with two job release and delivery times (Q2066683) (← links)
- Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan (Q2361139) (← links)
- Fast solution of single-machine scheduling problem with embedded jobs (Q2420645) (← links)
- Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
- Runway sequencing with holding patterns (Q2482798) (← links)
- Single machine scheduling subject to precedence delays (Q2563923) (← links)
- Algorithms for Necklace Maps (Q2950591) (← links)
- Effective iterative algorithms in scheduling theory (Q3714886) (← links)
- Scheduling Equal-Length Jobs with Delivery times on Identical Processors (Q4551464) (← links)
- Contiguous Cake Cutting: Hardness Results and Approximation Algorithms (Q5130002) (← links)
- Throughput scheduling with equal additive laxity (Q5918523) (← links)
- Throughput scheduling with equal additive laxity (Q5925675) (← links)
- Security-aware database migration planning (Q6154181) (← links)
