Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines
From MaRDI portal
Publication:917426
DOI10.1007/BF02096604zbMath0704.90041MaRDI QIDQ917426
Publication date: 1989
Published in: Annals of Operations Research (Search for Journal in Brave)
Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
General stochastic single-machine scheduling with regular cost functions ⋮ Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
Cites Work
- Sequencing jobs on a single machine with a common due data and stochastic processing times
- Scheduling with Deadlines and Loss Functions
- Scheduling tasks with exponential service times on parallel processors
- Scheduling Jobs with Exponentially Distributed Processing Times on Two Machines with Resource Constraints
- Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines
- Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling
- Stochastic Scheduling with Release Dates and Due Dates
- On the Expected Relative Performance of List Scheduling
- Probabilistic Bounds on the Performance of List Scheduling
- Preemptive Scheduling with Due Dates
- Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors
- Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Two-Processor Scheduling with Start-Times and Deadlines
- Scheduling with Deadlines and Loss Functions on k Parallel Machines
- Bounds on Multiprocessing Timing Anomalies
