Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
117 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 2 Feb 2015 in math.OC and cs.SY

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.

Citations (1)

Summary

We haven't generated a summary for this paper yet.