1,724,130 research outputs found
Optimal scheduling problem to maximize the number of satisfied customers about fuzzy due date windows
This paper is concerned with the scheduling problem which maximizes the number of satisfied customers in fuzzy due date windows. We define the membership function for the completion time. It is assumed that the fixed penalty will occur if the value of the membership function is less than the grade of satisfaction. A polynomial time algorithm is presented to determined optimal scheduling. An example is shown to illustrate the effectiveness of the algorithm.<br/
Theorizing on the Political Economy of Cross-Strait Relations: An Analogy with Russia and Its Neighbors
- …
