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

This paper investigates common (slack) due-date assignment single-machine scheduling with controllable processing times within a group technology environment. Under linear and convex resource allocation functions, the cost function minimizes (including weighted sum of earliness, tardiness, assignment, where weights are position-dependent) resource-allocation costs. Given some optimal properties...

Abstract Most Workload Control literature assumes that delivery performance is determined by tardiness related measures only. While this may be true for companies directly deliver to end-customers, make-to-stock or firms are part of supply chains, producing early often means large inventories in the finished goods warehouse penalties incurred downstream chain. Some earlier studies used a so-cal...

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

The parallel machine scheduling problem is an important and difficult problem to be considered in the real-world situations. Traditionally, this problem consists of the scheduling of a set of independent jobs on parallel machines with the aim of minimizing the maximum job completion. In today's manufacturing systems, in which both early and tardy finishing of job processing are undesired, the o...