Some observations and extensions of the optimal TWK-power due-date determination and sequencing problem
This paper considers the same problem as studied previously by the first author [Int. J. Syst. Sci. 18, 1-7 (1987; Zbl 0615.90067)] which is concerned with the optimal determination of TWK-power due-dates and sequencing of n jobs on a single machine. A detailed analysis of the cost function used in Cheng's model is presented from which we note that under suitable assumptions a very simple way to find the optimal solution is available. An extension of the original due-date sequencing optimization problem is discussed and the necessary and sufficient optimality conditions for the extended problem are derived.
- Optimal TWK-power due-date determination and sequencing
- Optimal total-work-content-power due-date determination and sequencing
- Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
- Analytical determination of optimal TWK due-dates in a job shop
- Optimal due-date assignment and sequencing
This page was built for publication: Some observations and extensions of the optimal TWK-power due-date determination and sequencing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1117832)