Mathematica Eterna
Offener Zugang

Abstrakt

Group scheduling and due date assignment on a single machine with convex resource-dependent processing times

Yanxia Guo

This paper addresses a single-machine scheduling problem with simultaneous consideration of due date assignment and convex resource-dependent processing times under a group technology environment. The jobs of customers are classified into groups according to their production similarities in advance. The goal is to find the job schedule and the due date for each group that minimizes a cost function that includes the earliness, tardiness, due date assignment and resource alloction. The structual properties of the problem is studied and an important sepecial case is addressed