. For the scheduling model without buffer, we present some useful properties and develop a heuristic H for solving it. Then …, computational experiments with random instances of different sizes are conducted to evaluate the proposed heuristic H, and the … results show that our proposed algorithm is superior to other four approaches in the literature. Besides, heuristic H in our …

is derived and an upper bound is calculated using a novel constructive heuristic. The quality of the approach is tested …

In this paper we propose a heuristic for solving the problem of resource constrained preemptive scheduling in the two … minimization of makespan. The problem is NP-hard. The heuristic first sequences jobs on the machine at stage 1 and then solves the … sharing of the resources between the stages is taken into account is also derived. The performance of the heuristic evaluated …

(MixPacking) which combines a heuristic packing algorithm with the Best Fit algorithm is proposed to solve the single bin problem …, and then a backtracking algorithm which embeds MixPacking is developed to solve the 2DVSBPP. A hybrid heuristic algorithm …

identify high quality solutions. Our computational results indicate that this heuristic outperforms the existing approaches in …

research, various exact and heuristic solution procedures have been developed for different versions of the so-called assembly …

rectangles using a cluster heuristic or phi-functions for optimal clustering. All three approaches use a competitive algorithm …

, implementable, and yet effective heuristic policy. Our extensive numerical results suggest that the proposed heuristic can greatly …