ON A GENERALIZED OPTIMAL COMMON DUE-DATE ASSIGNMENT PROBLEM

1 December 1989

journal article
research article
Published by Taylor & Francis in Engineering Optimization

Vol. 15 (2) , 113-119
https://doi.org/10.1080/03052158908941146

Abstract

We consider a generalized optimal common due-date assignment problem and derive the optimality conditions for finding the optimal solution in this paper. We show that some versions of the common due-date determination problem can be treated as special cases of this generalized problem. For these special cases, we show that closed-form optimal solutions can be obtained from the optimality conditions. As for the solution of the generalized problem, we suggest an iterative solution procedure to help determine the optimal solution. Finally, we discuss the limiting behaviour of the optimal solution in a special situation and derive the asymptotic result

Keywords

This publication has 15 references indexed in Scilit:

Survey of scheduling research involving due date determination decisions
European Journal of Operational Research, 1989
Minimizing the average deviation of job completion times about a common due-date: An extension
Mathematical Modelling, 1987
Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
Management Science, 1987
An algorithm for the con due-date determination and sequencing problem
Computers & Operations Research, 1987
Minimizing mean absolute deviation of completion times about a common due date
Naval Research Logistics Quarterly, 1986
Single‐ and multiple‐processor models for minimizing completion time variance
Naval Research Logistics Quarterly, 1986
On Optimal Common Due-Date Determination
IMA Journal of Management Mathematics, 1986
A DUALITY APPROACH TO OPTIMAL DUE-DATE DETERMINATION
Engineering Optimization, 1985
Minimizing the average deviation of job completion times about a common due date
Naval Research Logistics Quarterly, 1981
Minimising Waiting Time Variance in the Single Machine Problem
Management Science, 1977