Photo by ry4nolson from unsplash
We study a scheduling problem with the objective of minimizing total absolute deviation of completion times (TADC). TADC is considered here in the most general form studied so far: the… Click to show full abstract
We study a scheduling problem with the objective of minimizing total absolute deviation of completion times (TADC). TADC is considered here in the most general form studied so far: the machine setting is that of parallel unrelated, job processing time are assumed to be position-dependent with no restrictions on the functional form, and the option of processing only a subset of the jobs (i.e., job-rejection) is allowed. We show that minimizing TADC in this very general form remains polynomially solvable in the number of jobs.
Keywords:
minimizing total;
absolute deviation;
processing;
completion times;
total absolute;
job
Journal Title: Annals of Operations Research
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Annals of Operations Research
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!