Single machine parallel-batch scheduling with deteriorating jobs

Scheduling family jobs on an unbounded parallel-batch machine to minimize makespan and maximum flow time

“…Li et al [18] investigated the scheduling problems on a p-batch machine to minimize the makespan with simple linear deterioration of processing times and release dates, and several algorithms were proposed both for bounded and unbounded model. Qi et al [33] considered several single p-batch scheduling problems, which involve three objectives for minimizing the maximum cost, the number of tardy jobs, and the total weighted completion time, and they devised the corresponding solving algorithms. Miao et al [24] studied p-batch scheduling problems of deteriorating jobs with identical release dates, and an optimal algorithm and an FPTAS were designed for single-machine case and multiple-machine case, respectively.…”

Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan

“…The objective was to minimize the makespan, and several algorithms were proposed for both unbounded and bounded models. Qi et al (2009) considered several single parallel batching machine scheduling problems. Three different algorithms were designed for minimizing the maximum cost, the number of tardy jobs, and the total weighted completion time, respectively.…”

Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan

“…The parallel-batch scheduling with deteriorating jobs was initiated by Qi et al [12]; Li et al [13] and Miao et al [14] also considered this scheduling; they gave some results for the minimizing makespan of the parallel-batch scheduling with the simple linear deterioration (i.e., = ). In this paper, we consider the parallel-batch scheduling with = + and = + .…”