A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden (Q579120): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 6 users not shown) | |||
Property / 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. | |||
Property / 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 4014425 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
job earliness | |||
Property / zbMATH Keywords: job earliness / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
measure of inventory costs | |||
Property / zbMATH Keywords: measure of inventory costs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
single machine scheduling | |||
Property / zbMATH Keywords: single machine scheduling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
flowtime | |||
Property / zbMATH Keywords: flowtime / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0305-0548(87)90033-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2037003659 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sequencing to Minimize the Maximum Job Cost / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing mean absolute deviation of completion times about a common due date / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing Mean Squared Deviation of Completion Times About a Common Due Date / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing the average deviation of job completion times about a common due date / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing the sum of absolute lateness in single-machine and multimachine scheduling / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:03, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden |
scientific article |
Statements
A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden (English)
0 references
1987
0 references
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.
0 references
job earliness
0 references
measure of inventory costs
0 references
single machine scheduling
0 references
flowtime
0 references
0 references
0 references
0 references