Minimizing total inventory cost on a single machine in just-in-time manufacturing

J.A. Hoogeveen, S.L. van de Velde

Research output: Book/ReportReportProfessional

45 Downloads (Pure)

Abstract

The just-in-time concept decrees not to accept ordered goods before their due dates in order to avoid inventory cost. This bounces the inventory cost back to the manufacturer: products that are completed before their due dates have to be stored. Reducing this type of storage cost by preclusion of early completion conflicts with the traditional policy of keeping work-in-process inventories down. This paper addresses a single-machine scheduling problem with the objective of minimizing total inventory cost, comprising cost associated with work-in-process inventories and storage cost as a result of early completion. The cost components are measured by the sum of the job completion times and the sum of the job earlinesses. This problem differs from more traditional scheduling problems, since the insertion of machine idle time may reduce total cost. The search for an optimal schedule, however, can be limited to the set of job sequences, since for any sequence there is a clear-cut way to insert machine idle time in order to minimize total inventory cost. We apply branch-and-bound to identify an optimal schedule. We present five approaches for lower bound calculation, based upon relaxation of the objective function, of the state space, and upon Lagrangian relaxation.
Original languageEnglish
Place of PublicationEindhoven
PublisherEindhoven University of Technology
Number of pages24
Publication statusPublished - 1992

Publication series

NameCOSOR Memorandum
PublisherEindhoven University of Technology
Volume92-20
ISSN (Print)0926-4493

Fingerprint

Single machine
Just-in-time manufacturing
Inventory cost
Costs
Due dates
Schedule
Single machine scheduling
Objective function
Lagrangian relaxation
Just-in-time
State space
Branch-and-bound
Lower bounds

Cite this

Hoogeveen, J. A., & van de Velde, S. L. (1992). Minimizing total inventory cost on a single machine in just-in-time manufacturing. (COSOR Memorandum; Vol. 92-20). Eindhoven: Eindhoven University of Technology.
Hoogeveen, J.A. ; van de Velde, S.L. / Minimizing total inventory cost on a single machine in just-in-time manufacturing. Eindhoven : Eindhoven University of Technology, 1992. 24 p. (COSOR Memorandum).
@book{d4a279ed64214ddfa8cd842c702b10f5,
title = "Minimizing total inventory cost on a single machine in just-in-time manufacturing",
abstract = "The just-in-time concept decrees not to accept ordered goods before their due dates in order to avoid inventory cost. This bounces the inventory cost back to the manufacturer: products that are completed before their due dates have to be stored. Reducing this type of storage cost by preclusion of early completion conflicts with the traditional policy of keeping work-in-process inventories down. This paper addresses a single-machine scheduling problem with the objective of minimizing total inventory cost, comprising cost associated with work-in-process inventories and storage cost as a result of early completion. The cost components are measured by the sum of the job completion times and the sum of the job earlinesses. This problem differs from more traditional scheduling problems, since the insertion of machine idle time may reduce total cost. The search for an optimal schedule, however, can be limited to the set of job sequences, since for any sequence there is a clear-cut way to insert machine idle time in order to minimize total inventory cost. We apply branch-and-bound to identify an optimal schedule. We present five approaches for lower bound calculation, based upon relaxation of the objective function, of the state space, and upon Lagrangian relaxation.",
author = "J.A. Hoogeveen and {van de Velde}, S.L.",
year = "1992",
language = "English",
series = "COSOR Memorandum",
publisher = "Eindhoven University of Technology",

}

Hoogeveen, JA & van de Velde, SL 1992, Minimizing total inventory cost on a single machine in just-in-time manufacturing. COSOR Memorandum, vol. 92-20, Eindhoven University of Technology, Eindhoven.

Minimizing total inventory cost on a single machine in just-in-time manufacturing. / Hoogeveen, J.A.; van de Velde, S.L.

Eindhoven : Eindhoven University of Technology, 1992. 24 p. (COSOR Memorandum; Vol. 92-20).

Research output: Book/ReportReportProfessional

TY - BOOK

T1 - Minimizing total inventory cost on a single machine in just-in-time manufacturing

AU - Hoogeveen, J.A.

AU - van de Velde, S.L.

PY - 1992

Y1 - 1992

N2 - The just-in-time concept decrees not to accept ordered goods before their due dates in order to avoid inventory cost. This bounces the inventory cost back to the manufacturer: products that are completed before their due dates have to be stored. Reducing this type of storage cost by preclusion of early completion conflicts with the traditional policy of keeping work-in-process inventories down. This paper addresses a single-machine scheduling problem with the objective of minimizing total inventory cost, comprising cost associated with work-in-process inventories and storage cost as a result of early completion. The cost components are measured by the sum of the job completion times and the sum of the job earlinesses. This problem differs from more traditional scheduling problems, since the insertion of machine idle time may reduce total cost. The search for an optimal schedule, however, can be limited to the set of job sequences, since for any sequence there is a clear-cut way to insert machine idle time in order to minimize total inventory cost. We apply branch-and-bound to identify an optimal schedule. We present five approaches for lower bound calculation, based upon relaxation of the objective function, of the state space, and upon Lagrangian relaxation.

AB - The just-in-time concept decrees not to accept ordered goods before their due dates in order to avoid inventory cost. This bounces the inventory cost back to the manufacturer: products that are completed before their due dates have to be stored. Reducing this type of storage cost by preclusion of early completion conflicts with the traditional policy of keeping work-in-process inventories down. This paper addresses a single-machine scheduling problem with the objective of minimizing total inventory cost, comprising cost associated with work-in-process inventories and storage cost as a result of early completion. The cost components are measured by the sum of the job completion times and the sum of the job earlinesses. This problem differs from more traditional scheduling problems, since the insertion of machine idle time may reduce total cost. The search for an optimal schedule, however, can be limited to the set of job sequences, since for any sequence there is a clear-cut way to insert machine idle time in order to minimize total inventory cost. We apply branch-and-bound to identify an optimal schedule. We present five approaches for lower bound calculation, based upon relaxation of the objective function, of the state space, and upon Lagrangian relaxation.

M3 - Report

T3 - COSOR Memorandum

BT - Minimizing total inventory cost on a single machine in just-in-time manufacturing

PB - Eindhoven University of Technology

CY - Eindhoven

ER -

Hoogeveen JA, van de Velde SL. Minimizing total inventory cost on a single machine in just-in-time manufacturing. Eindhoven: Eindhoven University of Technology, 1992. 24 p. (COSOR Memorandum).