On a single-machine optimal constant due-date assignment and sequencing problem
type: Item
instance of: scholarly article
title: On a single-machine optimal constant due-date assignment and sequencing problem
zbMATH Open document ID: 0656.90049
DOI: 10.1016/0893-9659(88)90096-1
published in: Applied Mathematics Letters
publication date: 1988-01-01T00:00:00Z
review text: This paper considers the problem of optimal constant due-date assignment and sequencing of jobs in a single-machine shop. We formulate the problem as a general constrained optimization problem and apply the Kuhn-Tucker conditions to find the optimal solution which is shown to be independent of the job sequence.
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 4072693
zbMATH Keywords: optimal constant due-date assignment
zbMATH Keywords: sequencing of jobs
zbMATH Keywords: single-machine shop
zbMATH Keywords: general constrained optimization
zbMATH Keywords: Kuhn-Tucker conditions
zbMATH Keywords: optimal solution
author: T. C. Edwin Cheng
MaRDI profile type: Publication
full work available at URL: 0893-9659(88)90096-1
OpenAlex ID: W2069382920
cites work: Survey of scheduling research involving due date determination decisions
description: scientific article; zbMATH DE number 4072693