Minimizing total completion time and total deviation of job completion times from a restrictive due-date

DOI10.1016/j.ejor.2003.09.029zbMath1112.90336OpenAlexW1980274192MaRDI QIDQ1776951

Gur Mosheiov

Publication date: 12 May 2005

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.09.029

zbMATH Keywords

dynamic programmingsingle machinemultiple criteriadeterministic scheduling

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Related Items

Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job

Cites Work

• Unnamed Item
• Multiple and bicriteria scheduling: A literature survey
• Complexity of single machine, multi-criteria scheduling problems
• Simultaneous minimization of total completion time and total deviation of job completion times
• Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
• 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