A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
type: Item
instance of: scholarly article
title: A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
zbMATH Open document ID: 0624.90044
DOI: 10.1016/0305-0548(87)90033-5
author: Timothy D. Fry
author: G. Keong Leong
published in: Computers \& Operations Research
publication date: 1987-01-01T00:00:00Z
review text: The concept of job earliness as a measure of inventory costs for single machine scheduling is introduced. The justification of earliness as a cost is presented. It is pointed out that the Japanese have long recognized earliness as a cost. The additon of earliness greatly complicated finding an optimum solution, since reducing earliness may require the insertion of machine idle time. Another measure commonly used to represent inventory cost is flowtime. In this paper, a combination of earliness and flowtime is used to represent total inventory costs. Some preliminary results are presented illustrating the complexity of solving this problem.
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 4014425
zbMATH Keywords: job earliness
zbMATH Keywords: measure of inventory costs
zbMATH Keywords: single machine scheduling
zbMATH Keywords: flowtime
MaRDI profile type: Publication
full work available at URL: 0305-0548(87)90033-5
OpenAlex ID: W2037003659
cites work: Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints
cites work: Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
cites work: Sequencing to Minimize the Maximum Job Cost
cites work: Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
cites work: Minimizing mean absolute deviation of completion times about a common due date
cites work: Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
cites work: Minimizing the average deviation of job completion times about a common due date
cites work: Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
cites work: Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
description: scientific article; zbMATH DE number 4014425