Fundamental lemmas for the determination of optimal control strategies for a class of single machine family scheduling problems

TL;DR

This paper introduces four fundamental lemmas that serve as the theoretical basis for determining optimal control strategies in complex single machine family scheduling problems involving sequence-dependent setups and controllable processing times.

Contribution

The paper presents new fundamental lemmas and a dynamic programming-based constructive procedure for solving advanced single machine scheduling problems with generalized due dates.

Findings

Lemmas provide theoretical foundation for optimal control decisions.

Constructive procedure effectively determines optimal schedules.

Illustrative examples demonstrate practical application of the lemmas.

Abstract

Four lemmas, which constitute the theoretical foundation necessary to determine optimal control strategies for a class of single machine family scheduling problems, are presented in this technical report. The scheduling problem is characterized by the presence of sequence-dependent batch setup and controllable processing times; moreover, the generalized due-date model is adopted in the problem. The lemmas are employed within a constructive procedure (proposed by the Author and based on the application of dynamic programming) that allows determining the decisions which optimally solve the scheduling problem as functions of the system state. Two complete examples of single machine family scheduling problem are included in the technical report with the aim of illustrating the application of the fundamental lemmas in the proposed approach.