National Natural Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [71701220]; Natural Science Foundation of Hunan ProvinceNatural Science Foundation of Hunan Province [2018JJ3891]; Fundamental Research Funds for the Central UniversitiesFundamental Research Funds for the Central Universities [17wkpy45]
机构署名：
本校为第一机构
院系归属：
交通运输与物流学院
摘要：
A batch processing machine (BPM) can simultaneously process several jobs and has wide applications in various industrial environments. This paper studies the problem of minimizing makespan on unrelated parallel BPMs with non-identical job sizes and arbitrary release times. In the environment of unrelated machines, each machine has a processing speed for each job. The unrelated BPM problem is the most general case of parallel BPM problems and is closer to actual production conditions. The problem under study is NP-hard. We present two lower bounds for the problem. Then a genetic algorithm based...
