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

DOI10.1016/J.IPL.2005.09.007MaRDI QIDQ1045898zbMATH OpenOpenAlexFDO

Authors 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

learning effectschedulingsingle machinetime-based

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A bi-criterion single-machine scheduling problem with learning considerations
• A concise survey of scheduling with time-dependent processing times
• Parallel machine scheduling with a learning effect
• Scheduling problems with a learning effect
• Scheduling with general job-dependent learning curves.
• Scheduling with time dependent processing times: Review and extensions
• Single-machine scheduling with learning considerations

Cited in

(21)

• 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
• 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
• Single machine group scheduling with learning effects and past-sequence-dependent setup times
• Minimizing the total completion time in a single-machine scheduling problem with a learning effect
• A Bicriteria Scheduling Problem with a Learning Effect: Total Completion Time and Total Tardiness
• 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

This page was built for publication: Minimizing the makespan in a single machine scheduling problem with a time-based learning effect

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045898)