Scheduling jobs with truncated exponential learning functions
From MaRDI portal
Publication:395856
DOI10.1007/s11590-011-0433-9zbMath1311.90055OpenAlexW2008263629MaRDI QIDQ395856
Xiao Yuan Wang, Ji-Bo Wang, Lin-Yan Sun, Lin-Hui Sun
Publication date: 30 January 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0433-9
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (18)
Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects ⋮ Scheduling jobs with general truncated learning effects including proportional setup times ⋮ Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect ⋮ Note on a single-machine scheduling problem with sum of processing times based learning and ready times ⋮ Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects ⋮ Tri-criteria single machine scheduling model with release times and learning factor ⋮ Parallel machine scheduling with general sum of processing time based models ⋮ Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times ⋮ Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects ⋮ Optimal due-date assignment problem with learning effect and resource-dependent processing times ⋮ Single machine scheduling with truncated job-dependent learning effect ⋮ Single machine scheduling with exponential learning functions ⋮ Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning ⋮ Single-machine scheduling problems with a learning effect matrix ⋮ The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard ⋮ Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect ⋮ A unified analysis for scheduling problems with variable processing times ⋮ Scheduling problems with effects of deterioration and truncated job-dependent learning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling with general position-based learning curves
- A revision of machine scheduling problems with a general learning effect
- Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects
- A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints
- Single machine multiple common due dates scheduling with learning effects
- Single-machine scheduling with nonlinear deterioration
- Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
- Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
- A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
- Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
- A note on single-machine group scheduling problems with position-based learning effect
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Single-machine scheduling with learning considerations
- Single-machine scheduling with both deterioration and learning effects
- Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times
- Some scheduling problems with general position-dependent and time-dependent learning effects
- Heuristic for a new multiobjective scheduling problem
- Parallel-machine scheduling under potential disruption
- A state-of-the-art review on scheduling with learning effects
- Encyclopedia of Optimization
- Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Single machine scheduling with learning effect considerations
This page was built for publication: Scheduling jobs with truncated exponential learning functions
