Performance analysis of active schedules in identical parallel machine

Active schedule is one of the most basic and popular concepts in production scheduling research. For identical parallel machine scheduling with jobs’ dynamic arrivals, the tight performance bounds of active schedules under the measurement of four popular objectives are respectively given in this paper. Similar analysis method and conclusions can be generalized to static identical parallel machine and single machine scheduling problem.

Performance analysis of active schedules in identical parallel machine

Active schedule is one of the most basic and popular concepts in production scheduling research. For identical parallel machine scheduling with jobs’ dynamic arrivals, the tight performance bounds of active schedules under the measurement of four popular objectives are respectively given in this paper. Similar analysis method and conclusions can be generalized to static identical parallel machine and single machine scheduling problem. This work was supported by the National Natural Science Foundation of China (No. 60474002, 60504026) and Shanghai Development Foundation for Science and Technology (No. 04DZ11008). Changjun WANG is a Ph.D. candidate in Shanghai Jiao Tong University. He received his M.S. degree from Shanghai University in 2002. His research interests include scheduling and control of production plan. Yugeng XI is a professor of Shanghai Jiao Tong University. He received his Ph.D. degree from Technical University of Munich, Germany in 1984. His research interests include predictive control, large-scale system, and intelligent robotics.