Gerodimos, A.E.

problem batch value batching operation algorithm element time requirement latenes section scheduling schedule 1 2 availability requirement machine batch availability programming processing research ÿ rst batch batching problems index recursion program processing time completion times objective implementation complexity property subsequence batching machine h =k ph improvement speci problem p scheduling problems approach brucker completion wagelman order gn +1 section 3 rst batch ÿ rst job c n potts completion time item availability case number heap h 1 batching problem h =1 ph values qk processing time pj n jobs e cient calculation data structure van hoesel job j structure deletion gerodimo a.p.m paper 109–118 time 0. letter instance two-operation ÿ rst programming algorithms jobs k operations research cient programming part variant process sizing speci ÿc operations