Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine
From MaRDI portal
(Redirected from Publication:474786)
Recommendations
- Single machine scheduling with a time-dependent learning effect and deteriorating jobs
- Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
- Learning effect and deteriorating jobs in the single machine scheduling problems
- Single-machine scheduling problems with the time-dependent learning effect
- Scheduling problems with effects of deterioration and truncated job-dependent learning
Cites work
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A concise survey of scheduling with time-dependent processing times
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- A note on scheduling problems with learning effect and deteriorating jobs
- A state-of-the-art review on scheduling with learning effects
- A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times
- A unified approach for scheduling with convex resource consumption functions using positional penalties
- Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Note on scheduling with general learning curves to minimize the number of tardy jobs
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with a learning effect
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling problems with learning and ageing effects: a survey
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
- Single-machine scheduling with learning considerations
- Time-dependent scheduling
- Two due date assignment problems in scheduling a single machine
- V-Shaped Policies for Scheduling Deteriorating Jobs
- Λ-Shaped Policies to Schedule Deteriorating Jobs
Cited in
(5)- A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
- Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
- Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs
- Scheduling with job-splitting considering learning and the vital-few law
- Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times
This page was built for publication: Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q474786)
