Family scheduling problems are characterized by a setup time structure where setups are only required between jobs from different families. We consider the problem of scheduling job families on parallel machines to minimize weighted deviation about a common due date. Various special cases of this problem have been considered in the literature. This note summarizes known complexity results and i...

We study a problem of scheduling a maintenance activity on a single machine. Following several recent papers, the maintenance is assumed to be deteriorating, that is, delaying the maintenance increases the time required to perform it. The following objective functions are considered: makespan, flowtime, maximum lateness, total earliness, tardiness and due-date cost, and number of tardy jobs. We...

This paper proposes exact algorithms to generate optimal timing schedules for a given sequence of operations in job shops minimize the total weighted earliness and tardiness. The are proposed two shop scheduling scenarios, one involving due dates only last operation each other all on jobs. Computational experiments benchmark problem instances reveal that, case scenario job, faster than those ge...

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, 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...