Preemptive Scheduling of Jobs with a Learning Effect on Two Parallel Machines
From MaRDI portal
Recommendations
- Parallel machine scheduling with a learning effect
- A note on parallel-machine scheduling with controllable processing times and job-dependent learning effects
- Scheduling identical jobs on uniform parallel machines under position-based learning effects
- Scheduling preemptive jobs with precedence constraints on parallel machines
- Scheduling deteriorating jobs with a learning effect on unrelated parallel machines
- Parallel machines scheduling with deteriorating and learning effects
- Preemptive and non-preemptive scheduling on two unrelated parallel machines
- Preemptive Scheduling of Stochastic Jobs with a Two-Stage Processing Time Distribution on M + 1 Parallel Machines
Cites work
- scientific article; zbMATH DE number 3561065 (Why is no real title available?)
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- Integer preemptive scheduling on parallel machines
- Multiagent scheduling. Models and algorithms
- Scheduling problems with a learning effect
- Scheduling with deadlines and loss functions
- Scheduling with time-changing effects and rate-modifying activities
- Time-dependent scheduling
Cited in
(4)- Scheduling identical jobs on uniform parallel machines under position-based learning effects
- A note on parallel-machine scheduling with controllable processing times and job-dependent learning effects
- Near-optimal solutions and tight lower bounds for the parallel machines scheduling problem with learning effect
- Optimal preemptive algorithm for parallel machine scheduling with learning effect in cloud manufacturing
This page was built for publication: Preemptive Scheduling of Jobs with a Learning Effect on Two Parallel Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4685818)