Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
From MaRDI portal
Publication:969894
DOI10.1016/j.mcm.2009.05.026zbMath1185.90097OpenAlexW1982263380MaRDI QIDQ969894
Daniel Oron, Ertan Güner, M. Duran Toksarı
Publication date: 8 May 2010
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2009.05.026
Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)
Related Items (16)
A SINGLE-MACHINE TWO-AGENT SCHEDULING PROBLEM BY GA APPROACH ⋮ Effects of OCRA parameters and learning rate on machine scheduling ⋮ Note on a single-machine scheduling problem with sum of processing times based learning and ready times ⋮ Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times ⋮ Single-Machine Scheduling Problems Simultaneous with Deteriorating and Learning Effects Under a Deteriorating Maintenance Consideration ⋮ A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs ⋮ Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine ⋮ Notes on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning ⋮ Joint reply to the erratum and the note on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning ⋮ Single-machine scheduling with deteriorating jobs ⋮ A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function ⋮ Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration ⋮ Notes on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning [Math. Comput. Modelling 50 (2009) 401-406] ⋮ A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times ⋮ Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs ⋮ Uncertain single-machine scheduling with deterioration and learning effect
Cites Work
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
- Single-machine and two-machine flowshop scheduling with general learning functions
- Single-machine scheduling with learning considerations
- A concise survey of scheduling with time-dependent processing times
- Scheduling with general job-dependent learning curves.
- Minimizing total tardiness in a scheduling problem with a learning effect
- Single-machine group scheduling with a time-dependent learning effect
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Scheduling with time dependent processing times: Review and extensions
- A bi-criteria two-machine flowshop scheduling problem with a learning effect
- Scheduling Deteriorating Jobs on a Single Processor
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
- Λ-Shaped Policies to Schedule Deteriorating Jobs
- Scheduling problems with a learning effect
This page was built for publication: Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning