Minimizing the makespan in a single machine scheduling problem with a time-based learning effect

DOI10.1016/j.ipl.2005.09.007zbMath1184.68131MaRDI QIDQ1045898

Wen-Hung Kuo, Dar-Li Yang

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

zbMATH Keywords

scheduling; single machine; learning effect; time-based

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Single machine group scheduling with learning effects and past-sequence-dependent setup times, A Bicriteria Scheduling Problem with a Learning Effect: Total Completion Time and Total Tardiness, Bi-criteria single machine scheduling with a time-dependent learning effect and release times, Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect, Minimizing the total completion time in a single-machine scheduling problem with a learning effect, The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model, 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, Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences, Single machine scheduling with a generalized job-dependent cumulative effect, Single machine scheduling with precedence constraints and positionally dependent processing times, Some scheduling problems with time-dependent learning effect and deteriorating jobs, The symmetric quadratic knapsack problem: approximation and scheduling applications, Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases, Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects, The learning effect: getting to the core of the problem, Single-machine scheduling with general learning functions, Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance, A state-of-the-art review on scheduling with learning effects, Single-machine scheduling problems with start-time dependent processing time, Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications

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