Scheduling about a common due date with earliness and tardiness penalties

DOI10.1016/0305-0548(90)90046-AzbMath0693.90055OpenAlexW2074752083MaRDI QIDQ908845

Prabuddha De, Charles E. Wells, Jay B. Ghosh

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0305-0548(90)90046-a

zbMATH Keywords

branch and boundsingle machineheuristiccommon due dateindependent jobsmean squared derivation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items

A quadratic integer programming method for minimizing the mean squared deviation of completion times, Processing-plus-wait due dates in single-machine scheduling, Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem, Pseudopolynomial algorithms for CTV minimization in single machine scheduling, Scheduling to minimize weighted earliness and tardiness about a common due-date, A note on lower bound for completion time variance in single machine scheduling., On the general solution for a class of early/tardy problems, Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear 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, New results on the completion time variance minimization, Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms, Scheduling about a given common due date to minimize mean squared deviation of completion times, A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems, Bounds for the position of the smallest job in completion time variance minimization, A survey of the state-of-the-art of common due date assignment and scheduling research, Single machine scheduling with symmetric earliness and tardiness penalties, An exact algorithm to minimize mean squared deviation of job completion times about a common due date

Cites Work

• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• 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
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Minimizing the Time-in-System Variance for a Finite Jobset
• Minimizing Total Costs in One-Machine Scheduling
• Minimising Waiting Time Variance in the Single Machine Problem
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date
• Variance Minimization in Single Machine Sequencing Problems