Simultaneous minimization of total completion time and total deviation of job completion times

DOI10.1016/S0377-2217(03)00193-0zbMath1103.90046MaRDI QIDQ1877049

Gur Mosheiov

Publication date: 16 August 2004

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

zbMATH Keywords

Dynamic programming; Scheduling; Single machine; Multiple criteria; Deterministic; Pseudo-polynomial algorithm

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C39: Dynamic programming

Related Items

A multi-criteria scheduling with due-window assignment problem, Minimizing total completion time and total deviation of job completion times from a restrictive due-date, Hierarchical minimization of completion time variance and makespan in jobshops

Cites Work

• Unnamed Item
• Unnamed Item
• Equivalence of mean flow time problems and mean absolute deviation problems
• Complexity of single machine, multi-criteria scheduling problems
• On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
• Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing mean absolute deviation of completion times about a common due date
• Single- and multiple-processor models for minimizing completion time variance
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• On the Minimization of Completion Time Variance with a Bicriteria Extension