Sepúlveda Medina, Ignacio
(Universidad de Concepción., 2021)
We consider the parallel machine scheduling problem without preemption
adding a batch completion constraint that forces to process a certain percent age h% of each batch during a period of time. The objective is to minimize ...