A single-machine scheduling with preventive periodic maintenance activities in a remanufacturing system including resumable and non-resumable jobs is studied.The objective is to find a schedule to minimize the makespa...A single-machine scheduling with preventive periodic maintenance activities in a remanufacturing system including resumable and non-resumable jobs is studied.The objective is to find a schedule to minimize the makespan and an LPT-LS algorithm is proposed.Non-resumable jobs are first scheduled in a machine by the longest processing time（LPT） rule,and then resumable jobs are scheduled by the list scheduling（LS） rule.And the worst-case ratios of this algorithm in three different cases in terms of the value of the total processing time of the resumable jobs（denoted as S2） are discussed.When S2 is longer than the spare time of the machine after the non-resumable jobs are assigned by the LPT rule,it is equal to 1.When S2 falls in between the spare time of the machine by the LPT rule and the optimal schedule rule,it is less than 2.When S2 is less than the spare time of the machine by the optimal schedule rule,it is less than 2.Finally,numerical examples are presented for verification.展开更多
The single-machine lot scheduling problem with splittable jobs to minimize the number of tardy jobs has been showed to be weakly NP-hard in the literature.In this paper,we show that a generalized version of this probl...The single-machine lot scheduling problem with splittable jobs to minimize the number of tardy jobs has been showed to be weakly NP-hard in the literature.In this paper,we show that a generalized version of this problem in which jobs have deadlines is strongly NP-hard,and also present the results of some related scheduling problems.展开更多
In this paper we consider a single-machine scheduling model with deteriorating jobs and simultaneous learning, and we introduce polynomial solutions for single machine makespan minimization, total flow times minimizat...In this paper we consider a single-machine scheduling model with deteriorating jobs and simultaneous learning, and we introduce polynomial solutions for single machine makespan minimization, total flow times minimization and maximum lateness minimization corresponding to the first and second special cases of our model under some agreeable conditions. However, corresponding to the third special case of our model, we show that the optimal schedules may be different from those of the classical version for the above objective functions.展开更多
With the urban expansion and economic restructuring, the jobs-housing relationship has become an important issue in studies on urban spatial structure. This paper employed a job accessibility model, which is an evalua...With the urban expansion and economic restructuring, the jobs-housing relationship has become an important issue in studies on urban spatial structure. This paper employed a job accessibility model, which is an evaluation instrument to measure the jobs-housing relationship in Beijing Metropolitan Area from a job accessibility perspective. The results indicate that the population in the central city is declining, whereas the population in the suburbs is consistently growing and forming new population centers. However, the distribution pattern of employment is still highly centralized. Job accessibility varies in different locations, but the inner-city areas(within the Third Ring road) have seen improved job accessibility over time while job accessibility in the suburbs(especially outside the Fourth Ring road) has decreased, and this has led it to become a primary area of residential and employment mismatch. At the same time, the new towns in the outer suburbs have not yet demonstrated great potential to attract more jobs. In addition we find that, to some extent, urban planning changes the jobs-housing relationship, but a polycentric urban spatial structure is not yet evident. The floating population and related housing policy also affect the jobs-housing relationship. We propose some measures to resolve the spatial mismatch as well as some future research directions.展开更多
This paper considers single-machine scheduling problems in group technology with the jobs' processing times being simple linear functions of their start times.The objective functions are the ~minimizing of makespa...This paper considers single-machine scheduling problems in group technology with the jobs' processing times being simple linear functions of their start times.The objective functions are the ~minimizing of makespan and total weighted completion time.Some optimal conditions and algorithms are given and the fact that the problem of total weighted completion times is NP-hard is proved.展开更多
基金The National Natural Science Foundation of China (No.70971022,71271054)the Scientific Research Innovation Project for College Graduates in Jiangsu Province(No.CXLX_0157)the Scientific Research Foundation of the Education Department of Anhui Province(No.2011sk123)
文摘A single-machine scheduling with preventive periodic maintenance activities in a remanufacturing system including resumable and non-resumable jobs is studied.The objective is to find a schedule to minimize the makespan and an LPT-LS algorithm is proposed.Non-resumable jobs are first scheduled in a machine by the longest processing time（LPT） rule,and then resumable jobs are scheduled by the list scheduling（LS） rule.And the worst-case ratios of this algorithm in three different cases in terms of the value of the total processing time of the resumable jobs（denoted as S2） are discussed.When S2 is longer than the spare time of the machine after the non-resumable jobs are assigned by the LPT rule,it is equal to 1.When S2 falls in between the spare time of the machine by the LPT rule and the optimal schedule rule,it is less than 2.When S2 is less than the spare time of the machine by the optimal schedule rule,it is less than 2.Finally,numerical examples are presented for verification.
基金Supported by National Natural Science Foundation of China(Grant Nos.12071442,11971443,12271491)。
文摘The single-machine lot scheduling problem with splittable jobs to minimize the number of tardy jobs has been showed to be weakly NP-hard in the literature.In this paper,we show that a generalized version of this problem in which jobs have deadlines is strongly NP-hard,and also present the results of some related scheduling problems.
文摘In this paper we consider a single-machine scheduling model with deteriorating jobs and simultaneous learning, and we introduce polynomial solutions for single machine makespan minimization, total flow times minimization and maximum lateness minimization corresponding to the first and second special cases of our model under some agreeable conditions. However, corresponding to the third special case of our model, we show that the optimal schedules may be different from those of the classical version for the above objective functions.
基金Under the auspices of National Natural Science Foundation of China(No.41271132)
文摘With the urban expansion and economic restructuring, the jobs-housing relationship has become an important issue in studies on urban spatial structure. This paper employed a job accessibility model, which is an evaluation instrument to measure the jobs-housing relationship in Beijing Metropolitan Area from a job accessibility perspective. The results indicate that the population in the central city is declining, whereas the population in the suburbs is consistently growing and forming new population centers. However, the distribution pattern of employment is still highly centralized. Job accessibility varies in different locations, but the inner-city areas(within the Third Ring road) have seen improved job accessibility over time while job accessibility in the suburbs(especially outside the Fourth Ring road) has decreased, and this has led it to become a primary area of residential and employment mismatch. At the same time, the new towns in the outer suburbs have not yet demonstrated great potential to attract more jobs. In addition we find that, to some extent, urban planning changes the jobs-housing relationship, but a polycentric urban spatial structure is not yet evident. The floating population and related housing policy also affect the jobs-housing relationship. We propose some measures to resolve the spatial mismatch as well as some future research directions.
文摘This paper considers single-machine scheduling problems in group technology with the jobs' processing times being simple linear functions of their start times.The objective functions are the ~minimizing of makespan and total weighted completion time.Some optimal conditions and algorithms are given and the fact that the problem of total weighted completion times is NP-hard is proved.
