Upper bound of direct-remove suboptimum for perturbation-iteration method in bin packing problems

Nonpreemptive scheduling for multiprocessor systems with hard deadline, i.e. the bin-packing problem, is addressed. The perturbation and iteration (PI) method is bin packing and the upper bound of a suboptimal scheduling are investigated. The p-q exchanges and direct removes are introduced. Suboptimum, such as direct-remove and 0-1 suboptimum, is defined according to the perturbations. The results show that the PI method improves the performance of an existing schedule. The upper bound of direct-remove suboptimum is obtained