Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects
From MaRDI portal
Publication:1667841
DOI10.1016/j.apm.2012.11.001zbMath1426.90139OpenAlexW1968488614MaRDI QIDQ1667841
Publication date: 30 August 2018
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2012.11.001
Related Items (10)
Single-machine group scheduling with processing times dependent on position, starting time and allotted resource ⋮ Parallel-machine scheduling problems with past-sequence-dependent delivery times and aging maintenance ⋮ Research on delivery times scheduling with truncated learning effects ⋮ Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect ⋮ Group scheduling with general autonomous and induced learning effect ⋮ Research on permutation flow shop scheduling problems with general position-dependent learning effects ⋮ Research on single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs ⋮ Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs ⋮ A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects ⋮ SCHEDULING POSITION-BASED DETERIORATING JOBS WITH MULTIPLE RATE-MODIFYING ACTIVITIES AND PAST-SEQUENCE-DEPENDENT DELIVERY TIMES
Cites Work
- Unnamed Item
- Minimizing makespan in three-machine flow shops with deteriorating jobs
- Single-machine scheduling with convex resource dependent processing times and deteriorating jobs
- Scheduling jobs with truncated exponential learning functions
- Scheduling with general position-based learning curves
- A revision of some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
- 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
- Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect
- Single machine multiple common due dates scheduling with learning effects
- Single-machine due-window assignment problem with learning effect and deteriorating jobs
- A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time
- 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
- Single-machine and two-machine flowshop scheduling with general learning functions
- A note on single-machine group scheduling problems with position-based learning effect
- A due-date assignment problem with learning effect and deteriorating jobs
- Single-machine scheduling problems with a learning effect
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Single-machine scheduling with learning considerations
- Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning
- 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
- A state-of-the-art review on scheduling with learning effects
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Scheduling Problems with Learning and Ageing Effects: A Survey
- Single-machine scheduling with a sum-of-actual-processing-time-based learning effect
- Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines
- Single machine scheduling with a time-dependent learning effect and deteriorating jobs
- 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
- Scheduling jobs with position-dependent processing times
- Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs
This page was built for publication: Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects
