Chun-Yuan Cheng

Learn More
This paper addresses the batch scheduling problem of unrelated parallel machines attempting to minimize the total weighted tardiness. Identical or similar jobs are typically processed in batches to decrease setup and/or processing times. Local dispatching rules such as the earliest weighted due date, the shortest weighted processing time, and the earliest(More)
This paper addresses the open shop scheduling problem to minimize the total completion time, provided that one of the machines has to process the jobs in a given sequence. The problem is NP-hard in the strong sense even for the two-machine case. A lower bound is derived based on the optimal solution of a relaxed problem in which the operations on every(More)
An approach for generating dependent random variates with specdled margmrd distributions and measure of correlation is developed based upon an analogy between correlation and force. We first examine the mathematical transformation implied by thts analogy and attempt to construct a general algorithm for generating variates that have the desired properties.(More)
! Remove all the English stop-words with the NLTK library. Remove anchors that match the time or date formats in regular expressions. ! Remove anchors that have lowercase initials. ! Apply the maximum matching method to locate and select the longest ! candidate from the n-gram results. Our system selects to map the English anchor candidates in the test(More)
Based on the theoretical model, a numerical method is usually necessary for obtaining the optimal preventive maintenance (PM) policy for a deteriorating system since the theoretical model becomes complicated when the system's hazard rate function is changed after each PM. It makes the application of the theoretical model not suitable for real cases.(More)