Cuixia Miao

Learn More
a r t i c l e i n f o a b s t r a c t Keywords: Analysis of algorithms Parallel-batch scheduling Deteriorating job NP-hard Fully polynomial time approximation scheme (FPTAS) We consider the bounded parallel-batch scheduling problem in which the processing time of a job is a simple linear function of its starting time. The objective is to minimize the(More)
We consider the unbounded parallel batch scheduling with deterioration, release dates, and rejection. Each job is either accepted and processed on a single batching machine, or rejected by paying penalties. The processing time of a job is a simple linear increasing function of its starting time. The objective is to minimize the sum of the makespan of the(More)
In this paper, we consider the scheduling problem of minimizing total weighted completion time on uniform machines with unbounded batch. Each of the machine M l (l = 1, ⋅ ⋅ ⋅ , m) has a speed s l and can process up to B(≥ n) jobs simultaneously as a batch. The processing time of a batch denoted by P(B) is given by the processing time of the longest job in(More)
  • 1