Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects
From MaRDI portal
(Redirected from Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects)
Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects''
Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects''
Recommendations
- Some scheduling problems on a single machine with general job effects of position-dependent learning and start-time-dependent deterioration
- Several single-machine scheduling problems with general learning effects
- Some scheduling problems with general position-dependent and time-dependent learning effects
- Some single machine scheduling problems with an actual time-dependent and position-dependent learning effect
- Approximation algorithms for some position-dependent scheduling problems
Cites work
- A bi-criterion single-machine scheduling problem with learning considerations
- A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
- A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- A state-of-the-art review on scheduling with learning effects
- Flow-shop scheduling with a learning effect
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
- PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
- Real-time preemptive scheduling of sporadic tasks based on supervisory control of discrete event systems
- Scheduling jobs under increasing linear machine maintenance time
- Scheduling problems with a learning effect
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- Single machine scheduling with learning effect considerations
- Single-machine and two-machine flowshop scheduling with general learning functions
- Single-machine scheduling problems with a learning effect
- Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect
- Single-machine scheduling with learning considerations
- Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
- Some scheduling problems with general position-dependent and time-dependent learning effects
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Time-dependent scheduling
Cited in
(17)- A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
- Re-entrant flowshop scheduling with learning considerations to minimize the makespan
- Parallel-machine scheduling with past-sequence-dependent delivery times and learning effect
- Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect
- Approximation algorithms for some position-dependent scheduling problems
- Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns
- Single machine scheduling with exponential learning functions
- Parallel-machine scheduling with potential disruption and positional-dependent processing times
- Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
- Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect
- Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Four single-machine scheduling problems involving due date determination decisions
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
- Some scheduling problems on a single machine with general job effects of position-dependent learning and start-time-dependent deterioration
- RETRACTED ARTICLE: Approach towards problem solving on single machine scheduling with unequal release dates and learning effect
- A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function
This page was built for publication: Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545340)
