Single-machine scheduling to minimize absolute deviation of completion times from a common due date
From MaRDI portal
Publication:3829339
DOI<663::AID-NAV3220360510>3.0.CO;2-X 10.1002/1520-6750(198910)36:5<663::AID-NAV3220360510>3.0.CO;2-XzbMath0674.90049OpenAlexW2090484759MaRDI QIDQ3829339
Publication date: 1989
Full work available at URL: https://doi.org/10.1002/1520-6750(198910)36:5<663::aid-nav3220360510>3.0.co;2-x
Related Items
Scheduling with monotonous earliness and tardiness penalties, A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time, Machine scheduling with earliness, tardiness and non-execution penalties, Genetic search with dynamic operating disciplines, Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem, Single machine \(\text{MAD}/T_{\max}\) problem with a common due date, Job sequencing and due date assignment in a single machine shop with uncertain processing times, Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach, A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date, Minimization of total absolute deviation for a common due date, Scheduling around a small common due date, Scheduling to minimize weighted earliness and tardiness about a common due-date, A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date, On the general solution for a class of early/tardy problems, Capacitated two-parallel machines scheduling to minimize sum of job completion times, On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties, Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date, Single machine weighted earliness-tardiness penalty problem with a common due date, Multicriteria scheduling problems: a survey, Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates, Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval, Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem, A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems, Determination of fault-tolerant fabric-cutting schedules in a just-in-time apparel manufacturing environment, A survey of the state-of-the-art of common due date assignment and scheduling research, An exact algorithm to minimize mean squared deviation of job completion times about a common due date
