Papers by Author: X.H. Lu

Paper TitlePage

Abstract: The classical job-shop scheduling problems (JSP) become assembly job-shop scheduling problems (AJSP) if assembly constraints are attached to them. The entire solution space size and the feasible one of AJSP are analyzed and obtained by utilizing combinational mathematics. It is proved that the feasible solution space takes extremely small portion of the entire one. To minimize the makespan of AJSP, genetic algorithm searching in feasible solution space (FGA) is proposed and designed, and the search range of FGA is limited to feasible solution space. Finally, benchmarks tests and results are given which demonstrate the advantage and efficiency of FGA.
705
Abstract: A design proposal for developing a high-precision timer of the real-time digital copying control system is put forward by analyzing the real-time characteristics of Windows 2000 operating system. Proposals of using information systems timer—WM_TIMER, multimedia timer, VxD and hardware to achieve high-precision timing in Windows operating system are analyzed and compared. Based on computer high-frequency timer and multi-thread technology, timing function provided by Microsoft Visual C++ is used to achieve a high-precision software timer of the system. Finally, the researched timing method is tested in Advantech IPC-610 host with Intel Pentium 4 processor, and the maximum timing error is less than 5μs which meets the system timing requirements.
87
Showing 1 to 2 of 2 Paper Titles