Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
From MaRDI portal
Publication:1045898
DOI10.1016/j.ipl.2005.09.007zbMath1184.68131OpenAlexW1985977197MaRDI QIDQ1045898
Publication date: 18 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.09.007
Learning and adaptive systems in artificial intelligence (68T05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (21)
Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation ⋮ A bicriteria parallel machine scheduling with a learning effect of setup and removal times ⋮ Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications ⋮ The learning effect: getting to the core of the problem ⋮ Single-machine scheduling with general learning functions ⋮ Bi-criteria single machine scheduling with a time-dependent learning effect and release times ⋮ The symmetric quadratic knapsack problem: approximation and scheduling applications ⋮ A Bicriteria Scheduling Problem with a Learning Effect: Total Completion Time and Total Tardiness ⋮ Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect ⋮ Single machine scheduling with a generalized job-dependent cumulative effect ⋮ Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance ⋮ Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects ⋮ A state-of-the-art review on scheduling with learning effects ⋮ Single machine group scheduling with learning effects and past-sequence-dependent setup times ⋮ Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases ⋮ Single machine scheduling with precedence constraints and positionally dependent processing times ⋮ Minimizing the total completion time in a single-machine scheduling problem with a learning effect ⋮ Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences ⋮ The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model ⋮ Some scheduling problems with time-dependent learning effect and deteriorating jobs ⋮ Single-machine scheduling problems with start-time dependent processing time
Cites Work
- Single-machine scheduling with learning considerations
- A concise survey of scheduling with time-dependent processing times
- Scheduling with general job-dependent learning curves.
- A bi-criterion single-machine scheduling problem with learning considerations
- Scheduling with time dependent processing times: Review and extensions
- Parallel machine scheduling with a learning effect
- Scheduling problems with a learning effect
This page was built for publication: Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
