Preemptive scheduling of two uniform parallel machines to minimize total tardinessWe consider the problem of preemptive
scheduling n jobs on two uniform
parallel machines. All jobs
Parallel machine scheduling models with the total machine costWe introduce the classification of the
parallel machine problems with the total
machine cost, which
Cost-aware scheduling on uniform parallel machinesWe consider
scheduling problems with uniform
parallel machines to minimize the sum of the total
Joint decision-making of parallel machine scheduling restricted in job-machine release time and preventive maintenance with remaining useful life constraintsHe, X.,
Wang, Z.,
Li, Y.,
Khazhina, S.,
Du, W.,
Wang, J.,
Wang, W. at the
parallel machine scheduling problem. Based on this, a corresponding mixed integer programming model