In this research paper, n jobs have to be scheduled on one-machine minimize the sum of maximum earliness and tardiness. We solved a series bi-criteria scheduling problems that related Three new algorithms were presented, two for hierarchical objective one simultaneous objective. Using results these algorithms, we This considered as NP-hard problem, it is also irregular, so missed some helpful p...

In this paper, a multi objective model in which operation planning and tool assignment flexible manufacturing system (FMS) has been considered simultaneously. regard, the main characteristics of FMS have analyzed. Then, comprehensive model, including major parameters cost components designed presented. The proposed contains factors machining cost, earliness tardiness penalties, part movement or...

In this paper, the single-machine scheduling problems under common and slack due date assignments are studied, where actual processing time of job needs to consider some factors, such as convex resource allocation, maintenance activity, learning effects. The goal study is find optimal sequence, activity location, allocation (flow allowance). objective function (1) minimize sum cost (including w...

In <span>optimization, scheduling problems is concerning allocations of some resources which are usually limited. These done in order to fulfil criterion by performing tasks or jobs optimize one more objective functions. Simultaneous multi-criteria problem known as np-hard optimization problem. Here, we consider three criteria for a number on single machine. The minimize the sum total com...