Greedy heuristic

Dobson, G. (1982), Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data, Mathematics of Operations Research, Vol. 7, pp. 515-531. 

Orders operations within each class, iising a greedy heuristic. Operations that take longer to execute are scheduled before operations that take less time, and for operations that take an equal amount of time, the operation with the earliest available data is scheduled. 

Uses a greedy heuristic, choosing the functional unit that will result in the least idle time. At the end of this phase, all buses are connected to all inputs of all functional units via multiplexors, and all registers are connected to all buses. 

Ant Colony Optimization (ACO) meta-heuristics is one such technique that is based on the cooperative forging strategy of real ants [1],[2]. In this approach, several artificial ants perform a sequence of operations iteratively. Ants are guided by a greedy heuristic algorithm which is problem dependenf that aid their search for better solutions iteratively. Ants seek solutions using information gathered previously to... 

Constructive searches based on more complicated efficiency ratios are much more common than the pure greedy notion of considering only objective coefficient magnitudes. One example is Dobson s (1982), heuristic for generalized covering problems of the form... 

Resource sharing between operations in different c-step are heuristic and greedy now, but sharing between conditional mutual exclusive operaions are accomplish globally. 

---