A dual problem for convex generalized fractional programs with no duality gap is presented and it is shown how this dual program can be efficiently solved using a parametric approach. The resulting algorithm can be seen as "dual" to the Dinkelbach-type algorithm for generalized fractional...

In this paper, we present a heuristic procedure based on tabu search (TS) and intelligent memory structures for solving this problem. The TS method starts with a feasible schedule generated by a greedy forward dispatching procedure, then through a series of intensification and diversification...

Audit scheduling with overlapping activities and sequence dependent setup cost has not been treated in literature. This paper presents a formulation and a solution approach for this audit scheduling problem. In this paper, we treat the activity duration as a decision variable and include...