An Enhanced tabu search algorithm to minimize a bi-criteria objective inn batching and scheduling problems on unrelated-parallel machines withn desired lower bounds on batch sizes

摘要

This paper addresses a sequence- and machine-dependent batch scheduling problem on a set of unrelated-parallel machines where the objective is to minimize a linear combination of total weighted completion time and total weighted tardiness. In particular, batch scheduling disregards the group technology assumptions by allowing for the possibility of splitting pre-determined groups of jobs into batches with respect to desired lower bounds on batch sizes. With regard to bounds on batch sizes, the M