The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model

DOI10.1016/J.INS.2012.02.043MaRDI QIDQ712692zbMATH OpenOpenAlexFDO

Authors Radosław Rudek

Publication date 17 October 2012

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2012.02.043

zbMATH Keywords

computational complexitydynamic programminglearningschedulingmetaheuristic

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models
• Single-machine scheduling problems with a sum-of-processing-time-based learning function
• Single-machine scheduling with general learning functions
• Single-machine scheduling with learning functions
• Single-machine scheduling problems with the time-dependent learning effect

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• A state-of-the-art review on scheduling with learning effects
• Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
• Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
• 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
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimization by simulated annealing
• Scheduling jobs under an aging effect
• Scheduling problems with general effects of deterioration and learning
• Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect
• Single machine scheduling with learning effect considerations
• Single-machine and two-machine flowshop scheduling with general learning functions
• Single-machine group scheduling with a time-dependent learning effect
• Single-machine scheduling problems with a learning effect
• Single-machine scheduling problems with the time-dependent learning effect
• Single-machine scheduling with learning considerations
• Single-machine scheduling with learning functions
• Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
• Some scheduling problems with general position-dependent and time-dependent learning effects
• Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
• Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations

Cited in

(20)

• Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
• A makespan minimization problem for versatile developers in the game industry
• Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times
• Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect
• A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects
• Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect
• Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
• An optimal online algorithm for scheduling with learning consideration
• Scheduling with job-splitting considering learning and the vital-few law
• A note on resource allocation scheduling with position-dependent workloads
• Single-machine scheduling with learning and forgetting effects
• Single machine group scheduling with time dependent processing times and ready times
• The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard
• Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs
• Four single-machine scheduling problems involving due date determination decisions
• Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models
• A note on scheduling jobs with extended sum-of-processing-times-based and position-based learning effect
• Scheduling with a position-weighted learning effect and job release dates
• Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
• On single processor scheduling problems with learning dependent on the number of processed jobs

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model

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