Scheduling jobs under an aging effect

From MaRDI portal
Publication:4933630


DOI10.1057/jors.2009.30zbMath1196.90048MaRDI QIDQ4933630

Adam Janiak, Radosław Rudek

Publication date: 14 October 2010

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.2009.30


90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research


Related Items

Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration, Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration, Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times, The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect, Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration, A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models, The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model, The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times, Maximum lateness scheduling on two-person cooperative games with variable processing times and common due date, Scheduling problems with position dependent job processing times: computational complexity results, Multitasking scheduling problems with deterioration effect, Scheduling flexible maintenance activities subject to job-dependent machine deterioration, Single-machine scheduling and due date assignment with rejection and position-dependent processing times, Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times