To solve the scheduling problem of dual-armed cluster tools for wafer fabrications with residency time and reentrant constraints,a heuristic scheduling algorithm was developed.Firstly,on the basis of formulating sched...To solve the scheduling problem of dual-armed cluster tools for wafer fabrications with residency time and reentrant constraints,a heuristic scheduling algorithm was developed.Firstly,on the basis of formulating scheduling problems domain of dual-armed cluster tools,a non-integer programming model was set up with a minimizing objective function of the makespan.Combining characteristics of residency time and reentrant constraints,a scheduling algorithm of searching the optimal operation path of dual-armed transport module was presented under many kinds of robotic scheduling paths for dual-armed cluster tools.Finally,the experiments were designed to evaluate the proposed algorithm.The results show that the proposed algorithm is feasible and efficient for obtaining an optimal scheduling solution of dual-armed cluster tools with residency time and reentrant constraints.展开更多
A batch is a subset of jobs which must be processed jointly in either serial or parallel form. For the single machine, batching, total completion time scheduling problems, the algorithmic aspects have been extensively...A batch is a subset of jobs which must be processed jointly in either serial or parallel form. For the single machine, batching, total completion time scheduling problems, the algorithmic aspects have been extensively studied in the literature. This paper presents the optimal hatching structures of the problems on the batching ways： all jobs in exactly N（arbitrary fix batch number and 1 〈 N 〈 n） batches.展开更多
The problem of discrete-time model identification of industrial processes with time delay was investigated.An iterative and separable method is proposed to solve this problem,that is,the rational transfer function mod...The problem of discrete-time model identification of industrial processes with time delay was investigated.An iterative and separable method is proposed to solve this problem,that is,the rational transfer function model parameters and time delay are alternately fixed to estimate each other.The instrumental variable technique is applied to guarantee consistent estimation against measurement noise.A noteworthy merit of the proposed method is that it can handle fractional time delay estimation,compared to existing methods commonly assuming that the time delay is an integer multiple of the sampling interval.The identifiability analysis for time delay is addressed and correspondingly,some guidelines are provided for practical implementation of the proposed method.Numerical and experimental examples are presented to illustrate the effectiveness of the proposed method.展开更多
Comparative space-time thinking lies at the heart of spatiotemporally integrated social sciences. The multiple dimensions and scales of socioeconomic dynamics pose numerous challenges for the application and evaluatio...Comparative space-time thinking lies at the heart of spatiotemporally integrated social sciences. The multiple dimensions and scales of socioeconomic dynamics pose numerous challenges for the application and evaluation of public policies in the comparative context. At the same time, social scientists have been slow to adopt and implement new spatiotemporally explicit methods of data analysis due to the lack of extensible software packages, which becomes a major impediment to the promotion of spatiotemporal thinking. The proposed framework will address this need by developing a set of research questions based on space-time-distributional features of socioeconomic datasets. The authors aim to develop, evaluate, and implement this framework in an open source toolkit to comprehensively quantify the changes and level of hidden variation of space-time datasets across scales and dimensions. Free access to the source code allows a broader community to incorporate additional advances in perspectives and methods, thus facilitating interdisciplinary collaboration. Being written in Python, it is entirely cross-platform, lowering transmission costs in research and education.展开更多
Job-shop scheduling problem with discretely controllable processing times (JSP-DCPT) is modeled based on the disjunctive graph, and the formulation of JSP-DCPT is presented. A three-step decomposition approach is prop...Job-shop scheduling problem with discretely controllable processing times (JSP-DCPT) is modeled based on the disjunctive graph, and the formulation of JSP-DCPT is presented. A three-step decomposition approach is proposed so that JSP-DCPT can be handled by solving a job-shop scheduling problem (JSP) and a series of discrete time-cost tradeoff problems. To simplify the decomposition approach, the time-cost phase plane is introduced to describe tradeoffs of the discrete time-cost tradeoff problem, and an extreme mode-based set dominant theory is elaborated so that an upper bound is determined to cut discrete time-cost tradeoff problems generated by using the proposed decomposition approach. An extreme mode-based set dominant decomposition algorithm (EMSDDA) is then proposed. Experimental simulations for instance JSPDCPT_FT10, which is designed based on a JSP benchmark FT10, demonstrate the effectiveness of the proposed theory and the decomposition approach.展开更多
This paper is concerned with the fractional version of online hierarchical scheduling problem on uniform machines.In the problem,the jobs and machines have several different hierarchies and each job can be arbitrarily...This paper is concerned with the fractional version of online hierarchical scheduling problem on uniform machines.In the problem,the jobs and machines have several different hierarchies and each job can be arbitrarily split between the machines with hierarchies not above the hierarchy of the job.The objective is to minimize the makespan.The authors present an optimal algorithm for the problem with three hierarchies.展开更多
基金Projects(7107111561273035)supported by the National Natural Science Foundation of China
文摘To solve the scheduling problem of dual-armed cluster tools for wafer fabrications with residency time and reentrant constraints,a heuristic scheduling algorithm was developed.Firstly,on the basis of formulating scheduling problems domain of dual-armed cluster tools,a non-integer programming model was set up with a minimizing objective function of the makespan.Combining characteristics of residency time and reentrant constraints,a scheduling algorithm of searching the optimal operation path of dual-armed transport module was presented under many kinds of robotic scheduling paths for dual-armed cluster tools.Finally,the experiments were designed to evaluate the proposed algorithm.The results show that the proposed algorithm is feasible and efficient for obtaining an optimal scheduling solution of dual-armed cluster tools with residency time and reentrant constraints.
基金Supported by the NSF of Henan Province(082300410070)
文摘A batch is a subset of jobs which must be processed jointly in either serial or parallel form. For the single machine, batching, total completion time scheduling problems, the algorithmic aspects have been extensively studied in the literature. This paper presents the optimal hatching structures of the problems on the batching ways： all jobs in exactly N（arbitrary fix batch number and 1 〈 N 〈 n） batches.
文摘The problem of discrete-time model identification of industrial processes with time delay was investigated.An iterative and separable method is proposed to solve this problem,that is,the rational transfer function model parameters and time delay are alternately fixed to estimate each other.The instrumental variable technique is applied to guarantee consistent estimation against measurement noise.A noteworthy merit of the proposed method is that it can handle fractional time delay estimation,compared to existing methods commonly assuming that the time delay is an integer multiple of the sampling interval.The identifiability analysis for time delay is addressed and correspondingly,some guidelines are provided for practical implementation of the proposed method.Numerical and experimental examples are presented to illustrate the effectiveness of the proposed method.
基金Under the auspices of Humanities and Social Science Research,Major Project of Chinese Ministry of Education(No.13JJD790008)Basic Research Funds of National Higher Education Institutions of China(No.2722013JC030)+2 种基金Zhongnan University of Economics and Law 2012 Talent Grant(No.31541210702)Key Research Program of Chinese Academy of Sciences(No.KZZD-EW-06-03,KSZD-EW-Z-021-03)National Key Science and Technology Support Program of China(No.2012BAH35B03)
文摘Comparative space-time thinking lies at the heart of spatiotemporally integrated social sciences. The multiple dimensions and scales of socioeconomic dynamics pose numerous challenges for the application and evaluation of public policies in the comparative context. At the same time, social scientists have been slow to adopt and implement new spatiotemporally explicit methods of data analysis due to the lack of extensible software packages, which becomes a major impediment to the promotion of spatiotemporal thinking. The proposed framework will address this need by developing a set of research questions based on space-time-distributional features of socioeconomic datasets. The authors aim to develop, evaluate, and implement this framework in an open source toolkit to comprehensively quantify the changes and level of hidden variation of space-time datasets across scales and dimensions. Free access to the source code allows a broader community to incorporate additional advances in perspectives and methods, thus facilitating interdisciplinary collaboration. Being written in Python, it is entirely cross-platform, lowering transmission costs in research and education.
基金supported by the National Natural Science Foundation of China (Grant Nos. 51075337, 50705076, 50705077)the Natural Sci-ence Basic Research Plan in Shaanxi Province of China (Grant No. 2009JQ9002)
文摘Job-shop scheduling problem with discretely controllable processing times (JSP-DCPT) is modeled based on the disjunctive graph, and the formulation of JSP-DCPT is presented. A three-step decomposition approach is proposed so that JSP-DCPT can be handled by solving a job-shop scheduling problem (JSP) and a series of discrete time-cost tradeoff problems. To simplify the decomposition approach, the time-cost phase plane is introduced to describe tradeoffs of the discrete time-cost tradeoff problem, and an extreme mode-based set dominant theory is elaborated so that an upper bound is determined to cut discrete time-cost tradeoff problems generated by using the proposed decomposition approach. An extreme mode-based set dominant decomposition algorithm (EMSDDA) is then proposed. Experimental simulations for instance JSPDCPT_FT10, which is designed based on a JSP benchmark FT10, demonstrate the effectiveness of the proposed theory and the decomposition approach.
基金supported by National Natural Science Foundation of China under Grant No.11171106
文摘This paper is concerned with the fractional version of online hierarchical scheduling problem on uniform machines.In the problem,the jobs and machines have several different hierarchies and each job can be arbitrarily split between the machines with hierarchies not above the hierarchy of the job.The objective is to minimize the makespan.The authors present an optimal algorithm for the problem with three hierarchies.
