Single-machine scheduling problems with a sum-of-processing-time-based learning function
From MaRDI portal
Publication:606421
DOI10.1155/2009/624108zbMath1297.90062OpenAlexW2080712843WikidataQ58647785 ScholiaQ58647785MaRDI QIDQ606421
Publication date: 17 November 2010
Published in: International Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2009/624108
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
- A note on the total completion time problem in a permutation flowshop with a learning effect
- Machine scheduling problems with a general learning effect
- Single-machine scheduling problems with a learning effect
- Single-machine scheduling with learning considerations
- 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
- Single-machine group scheduling with a time-dependent learning effect
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Single-machine scheduling problems with the time-dependent learning effect
- A bi-criteria two-machine flowshop scheduling problem with a learning effect
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling jobs with position-dependent processing times
- Complexity results for single-machine scheduling with positional learning effects
- Scheduling
- Single machine scheduling with learning effect considerations
- Scheduling problems with a learning effect
This page was built for publication: Single-machine scheduling problems with a sum-of-processing-time-based learning function
