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

DOI10.1016/J.INS.2012.02.043zbMATH Open1248.90052OpenAlexW1996594110MaRDI QIDQ712692FDOQ712692

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

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

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)

Cites Work

• Title not available (Why is that?)
• Optimization by simulated annealing
• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A state-of-the-art review on scheduling with learning effects
• Single-machine scheduling problems with a learning effect
• Single-machine scheduling with learning considerations
• Single machine scheduling with learning effect considerations
• Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
• Some scheduling problems with general position-dependent and time-dependent learning effects
• Single-machine group scheduling with a time-dependent learning effect
• Single-machine scheduling problems with the time-dependent learning effect
• Scheduling problems with general effects of deterioration and learning
• Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
• Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
• Single-machine and two-machine flowshop scheduling with general learning functions
• Single-machine scheduling with learning functions
• 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
• Scheduling jobs under an aging 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
• Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect

Cited In (18)

• Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
• Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times
• Four single-machine scheduling problems involving due date determination decisions
• A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects
• Single machine group scheduling with time dependent processing times and ready times
• A makespan minimization problem for versatile developers in the game industry
• Scheduling with job-splitting considering learning and the vital-few law
• Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
• A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect
• 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 CON/SLK due window assignment problems with sum-of-processed times based learning effect
• The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard
• Scheduling with a position-weighted learning effect and job release dates
• Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
• Single-machine scheduling with learning and forgetting effects
• Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs
• A note on resource allocation scheduling with position-dependent workloads
• Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect

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)