Advanced search
Publication Cover
Engineering Optimization Volume 15, 1989 - Issue 2
Submit an article Journal homepage
16
Views
5
CrossRef citations to date
0
Altmetric
Original Articles

ON A GENERALIZED OPTIMAL COMMON DUE-DATE ASSIGNMENT PROBLEM

T. C. E. CHENG Department of Actuarial & Management Sciences, University of Manitoba, Winnipeg, Manitoba, R3T 2N2, Canada
Pages 113-119 | Received 23 Feb 1989, Published online: 27 Apr 2007
 
Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days

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

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related Research Data

On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops
Source: Taylor & Francis
On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
Source: Institute for Operations Research and the Management Sciences (INFORMS)
Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
Source: Institute for Operations Research and the Management Sciences (INFORMS)
Minimizing the average deviation of job completion times about a common due-date: An extension
Source: Elsevier BV
Survey of scheduling research involving due date determination decisions
Source: Elsevier BV
Minimising Waiting Time Variance in the Single Machine Problem
Source: Institute for Operations Research and the Management Sciences (INFORMS)
On Optimal Common Due-Date Determination
Source: Oxford University Press (OUP)
A state-of-art survey of static scheduling research involving due dates
Source: Elsevier BV
An algorithm for the CON due-date determination and sequencing problem
Source: Elsevier BV
Minimizing the average deviation of job completion times about a common due date
Source: Wiley
A framework for the study of due date management in job shops
Source: Informa UK Limited
MINIMIZING MEAN ABSOLUTE DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE.
Source: Wiley
Minimizing the sum of absolute lateness in single‐machine and multimachine scheduling
Source: Wiley
A DUALITY APPROACH TO OPTIMAL DUE-DATE DETERMINATION
Source: Informa UK Limited
Single- and multiple-processor models for minimizing completion time variance
Source: Wiley

Linking provided by 

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.