Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines
From MaRDI portal
Publication:3612208
DOI10.1057/palgrave.jors.2602480zbMath1155.90392MaRDI QIDQ3612208
Publication date: 3 March 2009
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602480
scheduling; single machine; parallel identical machines; position-dependent processing times; measures of variation
90B35: Deterministic scheduling theory in operations research
Related Items
Scheduling jobs with truncated exponential learning functions, Flowshop scheduling problems with a position-dependent exponential learning effect, Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties, Total absolute deviation of job completion times on uniform and unrelated machines, Single-machine scheduling problems with both deteriorating jobs and learning effects, Scheduling jobs with an exponential sum-of-actual-processing-time-based learning effect, Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects, Scheduling deteriorating jobs with a learning effect on unrelated parallel machines, Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects, Precedence constrained parallel-machine scheduling of position-dependent jobs, A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection, Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times, Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times, A best possible algorithm for an online scheduling problem with position-based learning effect, Parallel machines scheduling with deteriorating and learning effects, Single machine scheduling with sum-of-logarithm-processing-times based and position based learning effects, Single machine scheduling with exponential learning functions
