Shujun Jiang

Learn More
This paper focuses on a re-entrant hybrid flowshop scheduling (RHFS) problem with the objective of minimizing the sum of weighted completion time of jobs. In the re-entrant hybrid flowshop considered here, there are several stages, each with identical parallel machines. This problem is strongly NP-hard since it is more complicated than general hybrid(More)
In this paper, we study a dynamic parallel machine scheduling problem with release times, where the release times and processing times of jobs may change during the production process due to uncertainties. The problem is different from classical scheduling problems in the deterministic environment where all information of jobs is known at the beginning of(More)
This paper introduces an error concealment algorithm for P frame in video images that based on the error concealment algorithm in the reference software of H.264, which makes it extremely easy and flexible to obtain the best performance of error concealment at the decoder, and describes the theoretical foundation and realization in detail. External boundary(More)
k-nearest-neighbour (KNN) has been widely used as an effective classification model. In this paper, we summarize three main shortcomings confronting KNN and then single out three categories of approaches for overcoming its three main shortcomings. After reviewing some algorithms in each category, we presented a hybrid algorithm called dynamic(More)
The paper considers a single machine scheduling problem with release dates to minimize the total completion times of jobs. The problem belongs to the class of NP-hard. We present a mixed-integer linear programming formulation based on slot idea. The original problem becomes an allocation problem where the main model decisions define the assignment of the(More)
In this paper, we introduce the notion of a quasi-contraction restricted with a linear bounded mapping in cone metric spaces, and prove a unique fixed point theorem for this quasi-contraction without the normality of the cone. It is worth mentioning that the main result in this paper could not be derived from´Ciri´c's result by the scalarization method, and(More)
In this paper we consider a single scheduling problem with release dates concerning time-deteriorating job processing time, where the processing time of a job is a piecewise linear deterioration function of its starting time. The objective of the problem is to minimize the total completion times of jobs. This problem is strongly NP-hard since it is a(More)
  • 1