Single machine and flowshop scheduling problems with sum-of-processing time based learning phenomenon
From MaRDI portal
Publication:2338473
DOI10.3934/JIMO.2018148zbMath1438.90127OpenAlexW2891935185WikidataQ128978458 ScholiaQ128978458MaRDI QIDQ2338473
Publication date: 21 November 2019
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2018148
Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem ⋮ An effective scheduling method to single-arm cluster tools for processing multiple wafer types ⋮ Due-window assignment scheduling with learning and deterioration effects
Cites Work
- Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times
- Resource constrained scheduling with general truncated job-dependent learning effect
- Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
- Single-machine and two-machine flowshop scheduling with general learning functions
- Note on ``Single-machine and flowshop scheduling with a general learning effect model and ``Some single-machine and m-machine flowshop scheduling problems with learning considerations
- Single-machine scheduling with learning considerations
- The single-machine total weighted tardiness scheduling problem with position-based learning effects
- Single-machine scheduling problems with a learning effect matrix
- Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times
- A bi-criterion single-machine scheduling problem with learning considerations
- 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 with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position
- Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects
- PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
- Single-machine scheduling with a sum-of-actual-processing-time-based learning effect
- A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect
- Single machine scheduling with learning effect considerations
This page was built for publication: Single machine and flowshop scheduling problems with sum-of-processing time based learning phenomenon
