Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
DOI10.1016/J.MCM.2009.05.026zbMATH Open1185.90097OpenAlexW1982263380MaRDI QIDQ969894FDOQ969894
Authors: M. Duran Toksarı, Daniel Oron, Ertan Güner
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
Recommendations
- Single-machine scheduling with both deterioration and learning effects
- Single machine scheduling with a time-dependent learning effect and deteriorating jobs
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Some scheduling problems with time-dependent learning effect and deteriorating jobs
- Some single-machine scheduling problems with general effects of learning and deterioration
Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Scheduling Deteriorating Jobs on a Single Processor
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
- Single-machine scheduling with learning considerations
- A concise survey of scheduling with time-dependent processing times
- Scheduling with general job-dependent learning curves.
- Scheduling with time dependent processing times: Review and extensions
- Scheduling problems with a learning effect
- Single-machine group scheduling with a time-dependent learning effect
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
- Single-machine and two-machine flowshop scheduling with general learning functions
- 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
- Λ-Shaped Policies to Schedule Deteriorating Jobs
- Minimizing total tardiness in a scheduling problem with a learning effect
- A bi-criteria two-machine flowshop scheduling problem with a learning effect
Cited In (21)
- A single-machine two-agent scheduling problem by GA approach
- Notes on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning [Math. Comput. Modelling 50 (2009) 401-406]
- Joint reply to the erratum and the note on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
- Notes on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
- Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine
- Uncertain single-machine scheduling with deterioration and learning effect
- Some single-machine scheduling with both learning and deterioration effects
- Single-machine scheduling with deteriorating jobs
- Genetic algorithm for a two-agent scheduling problem with truncated learning consideration
- A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times
- Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times
- Single-machine scheduling problems simultaneous with deteriorating and learning effects under a deteriorating maintenance consideration
- Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs
- Effects of OCRA parameters and learning rate on machine scheduling
- Single-machine scheduling with nonlinear deterioration
- 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
- A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function
- A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs
- Due date single machine scheduling problems with nonlinear deterioration and learning effects and past sequence dependent setup times
- Title not available (Why is that?)
This page was built for publication: Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q969894)