Abstract We consider a number of parallel-machine scheduling problems in which jobs have variable processing times. The actual time each job is described by an arbitrary positive function the position it holds on machine. However, itself may additionally depend or machine this was assigned to. Our aim to find schedule that minimizes objectives maximum completion total time. present full set pol...

The class of weak parallel machines is interesting, because it contains some realistic parallel machine models, especially suitable for pipelined computations. We prove that a modification of the bulk synchronous parallel (BSP) machine model, called decomposable BSP (dBSP), belongs to the class of weak parallel machines if restricted properly. We will also correct some earlier results about pip...