A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
From MaRDI portal
Publication:4729336
Recommendations
- Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions
- A fast algorithm for multi-machine scheduling problems with jobs of equal processing times
- A polynomial time approximation scheme for general multiprocessor job scheduling
- scientific article; zbMATH DE number 1979517
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Approximation Algorithms For Scheduling On Uniform Processors
- Approximation algorithms for scheduling on multi-core processor with shared speedup resources
- A composite algorithm for multiprocessor scheduling
- A parallel approximation scheme for the multiprocessor scheduling problem
Cited in
(45)- On a parallel machine scheduling problem with equal processing times
- Scheduling multiprocessor UET tasks of two sizes
- Minimizing the number of machines for scheduling jobs with equal processing times
- Scheduling lots of dependent unit-time operations on identical machines to minimize schedule length
- Scheduling unit-time jobs on processors with different capabilities
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
- Vehicle scheduling in two-cycle flexible manufacturing systems
- A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness
- A note on scheduling multiprocessor tasks with identical processing times.
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- Scheduling groups of unit length jobs on two identical parallel machines.
- Minimizing makespan on parallel machines subject to release dates and delivery times
- Theoretical expectation versus practical performance of Jackson's heuristic
- Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines
- Ideal schedules in parallel machine settings
- Scheduling jobs with release and delivery times subject to nested eligibility constraints
- Some algorithms of solving minimax multiprocessor scheduling problem
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
- Parallel machine problems with equal processing times: a survey
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
- A polynomial algorithm for multiprocessor scheduling with two job lengths.
- An improved LS algorithm for the problem of scheduling multi groups of jobs on multi processors at the same speed
- scientific article; zbMATH DE number 5964914 (Why is no real title available?)
- A fast algorithm for multi-machine scheduling problems with jobs of equal processing times
- scientific article; zbMATH DE number 3883925 (Why is no real title available?)
- On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals
- Variants of Multi-resource Scheduling Problems with Equal Processing Times
- scientific article; zbMATH DE number 4043236 (Why is no real title available?)
- scientific article; zbMATH DE number 4057269 (Why is no real title available?)
- Open shop problems with unit time operations
- Algorithms for Scheduling Independent Tasks
- scientific article; zbMATH DE number 516785 (Why is no real title available?)
- scientific article; zbMATH DE number 1157215 (Why is no real title available?)
- scientific article; zbMATH DE number 1523212 (Why is no real title available?)
- Scheduling Equal-Length Jobs with Delivery times on Identical Processors
- Parallel batch scheduling of equal-length jobs with release and due dates
- Bicriteria multi-machine scheduling with equal processing times subject to release dates
- Finding total unimodularity in optimization problems solved by linear programs
- A note on ``Scheduling unit-time tasks with integer release times and deadlines
- Scheduling electric vehicle regular charging tasks: a review of deterministic models
- Minimizing the number of tardy jobs with uniform processing times on parallel machines
- Level scheduling to minimize schedule length on lots of unit-time jobs
- Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions
This page was built for publication: A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4729336)
