Total absolute deviation of job completion times on uniform and unrelated machines

DOI10.1016/J.COR.2010.08.005zbMath1201.90083OpenAlexW2085843408MaRDI QIDQ609815

Baruch Mor, Gur Mosheiov

Publication date: 1 December 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.08.005

zbMATH Keywords

schedulinguniform machinesunrelated machinesposition-dependent processing timestotal absolute deviation of job completion times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Several flow shop scheduling problems with truncated position-based learning effect ⋮ Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times ⋮ Research on permutation flow shop scheduling problems with general position-dependent learning effects ⋮ A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection ⋮ Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties ⋮ Scheduling with Deteriorating Jobs and Non-Simultaneous Machine Available Times ⋮ Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads

Cites Work

• Unnamed Item
• Single machine scheduling with past-sequence-dependent setup times and learning effects
• Single machine scheduling problems with controllable processing times and total absolute differences penalties
• Completion time variance minimization on a single machine is difficult
• Single-machine scheduling with both deterioration and learning effects
• Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times
• Single-machine scheduling problems with past-sequence-dependent setup times
• Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
• Minimizing Variation of Flow Time in Single Machine Systems
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date

This page was built for publication: Total absolute deviation of job completion times on uniform and unrelated machines