In the traditional approaches, processes of planning and scheduling are done sequentially, where the process plan is determined before the actual scheduling is performed. This simple approach ignores ...

In this paper we introduce two general techniques for the design and analysis of approximation algorithms for NP-hard scheduling problems in which the objective is to minimize the weighted sum of the ...