Publication | Closed Access

Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes

Parallel BatchEngineeringParallel Complexity TheoryParallel ProcessingProduction SchedulingComputer EngineeringSystems EngineeringScheduling (Production Processes)Parallel ProgrammingComputer ScienceNon-identical Job SizesParallel ComputingParallel MetaheuristicsTotal Completion TimeOperations Research