Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time-dependent learning

DOI10.1051/ro/2010009zbMath1188.90112MaRDI QIDQ3561750

Daniel Oron, Ertan Güner, M. Duran Toksarı

Publication date: 26 May 2010

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2010__44_2_107_0/

zbMATH Keywords

scheduling; single machine; deterioration jobs; time-dependent learning effect; past sequence dependent (p-s-d) setup times

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

The third comprehensive survey on scheduling problems with setup times/costs, A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times

Cites Work

• Single machine scheduling with past-sequence-dependent setup times and learning effects
• Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
• Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
• 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 scheduling problems with past-sequence-dependent setup times
• 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
• Scheduling with time dependent processing times: Review and extensions
• Scheduling Deteriorating Jobs on a Single Processor
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Scheduling problems with a learning effect