Single machine \(\text{MAD}/T_{\max}\) problem with a common due date

DOI10.1016/S0305-0548(00)00107-6zbMath0995.90028WikidataQ127872605 ScholiaQ127872605MaRDI QIDQ1348560

V. Pereyra

Publication date: 14 May 2002

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

zbMATH Keywords

schedulingearlinesstradiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint

Cites Work

• Single machine scheduling to minimize weighted earliness subject to no tardy jobs
• Scheduling to minimize weighted earliness and tardiness 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
• Minimizing mean absolute deviation of completion times about a common due date
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Minimizing the Time-in-System Variance for a Finite Jobset
• Minimising Waiting Time Variance in the Single Machine Problem
• Variance Minimization in Single Machine Sequencing Problems

This page was built for publication: Single machine \(\text{MAD}/T_{\max}\) problem with a common due date