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)
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 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