Optimising lot sizing and order scheduling with non-linear production rates

Robert O. Neidigh, Terry Paul Harrison

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

This research focuses on developing an optimum production schedule in a process with a non-linear production rate. Non-linear production processes may exhibit an increasing production rate as the lot size increases, which results in increasing efficiency in per-unit production. The degree to which this learning is carried forward into the next lot varies by process. Sometimes the learning effect experiences a 100% carryover into the next lot, but other times some learning is forgotten and there is less than a 100% carryover. We consider processes in which the learning effect is completely forgotten from lot to lot. In practice non-linear processes are often treated as linear. That is, the production data are collected and aggregated over time and an average production rate is calculated which leads to inaccuracies in the production schedule. Here we use a discretised linear model to approximate the non-linear process. Production occurs in discrete time periods within which the amount produced is known. This enables a production schedule to be determined that minimises production and holding costs. A dynamic programming model that starts with the latest demand and progresses towards the earliest demand is used to solve the single-product single-machine problem. The model is tested using the production function from the PR#2 grinding process at CTS Reeves, a manufacturing firm in Carlisle, Pa. Solution times are determined for 50, 100, 200, 500, 1500, and 3000 periods.

Original languageEnglish (US)
Pages (from-to)2279-2295
Number of pages17
JournalInternational Journal of Production Research
Volume48
Issue number8
DOIs
StatePublished - Jan 1 2010

Fingerprint

Scheduling
Lot sizing
Dynamic programming
Schedule

All Science Journal Classification (ASJC) codes

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

@article{86bfc78fc7df45bcac09ef69856099b3,
title = "Optimising lot sizing and order scheduling with non-linear production rates",
abstract = "This research focuses on developing an optimum production schedule in a process with a non-linear production rate. Non-linear production processes may exhibit an increasing production rate as the lot size increases, which results in increasing efficiency in per-unit production. The degree to which this learning is carried forward into the next lot varies by process. Sometimes the learning effect experiences a 100{\%} carryover into the next lot, but other times some learning is forgotten and there is less than a 100{\%} carryover. We consider processes in which the learning effect is completely forgotten from lot to lot. In practice non-linear processes are often treated as linear. That is, the production data are collected and aggregated over time and an average production rate is calculated which leads to inaccuracies in the production schedule. Here we use a discretised linear model to approximate the non-linear process. Production occurs in discrete time periods within which the amount produced is known. This enables a production schedule to be determined that minimises production and holding costs. A dynamic programming model that starts with the latest demand and progresses towards the earliest demand is used to solve the single-product single-machine problem. The model is tested using the production function from the PR#2 grinding process at CTS Reeves, a manufacturing firm in Carlisle, Pa. Solution times are determined for 50, 100, 200, 500, 1500, and 3000 periods.",
author = "Neidigh, {Robert O.} and Harrison, {Terry Paul}",
year = "2010",
month = "1",
day = "1",
doi = "10.1080/00207540802684726",
language = "English (US)",
volume = "48",
pages = "2279--2295",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis Ltd.",
number = "8",

}

Optimising lot sizing and order scheduling with non-linear production rates. / Neidigh, Robert O.; Harrison, Terry Paul.

In: International Journal of Production Research, Vol. 48, No. 8, 01.01.2010, p. 2279-2295.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Optimising lot sizing and order scheduling with non-linear production rates

AU - Neidigh, Robert O.

AU - Harrison, Terry Paul

PY - 2010/1/1

Y1 - 2010/1/1

N2 - This research focuses on developing an optimum production schedule in a process with a non-linear production rate. Non-linear production processes may exhibit an increasing production rate as the lot size increases, which results in increasing efficiency in per-unit production. The degree to which this learning is carried forward into the next lot varies by process. Sometimes the learning effect experiences a 100% carryover into the next lot, but other times some learning is forgotten and there is less than a 100% carryover. We consider processes in which the learning effect is completely forgotten from lot to lot. In practice non-linear processes are often treated as linear. That is, the production data are collected and aggregated over time and an average production rate is calculated which leads to inaccuracies in the production schedule. Here we use a discretised linear model to approximate the non-linear process. Production occurs in discrete time periods within which the amount produced is known. This enables a production schedule to be determined that minimises production and holding costs. A dynamic programming model that starts with the latest demand and progresses towards the earliest demand is used to solve the single-product single-machine problem. The model is tested using the production function from the PR#2 grinding process at CTS Reeves, a manufacturing firm in Carlisle, Pa. Solution times are determined for 50, 100, 200, 500, 1500, and 3000 periods.

AB - This research focuses on developing an optimum production schedule in a process with a non-linear production rate. Non-linear production processes may exhibit an increasing production rate as the lot size increases, which results in increasing efficiency in per-unit production. The degree to which this learning is carried forward into the next lot varies by process. Sometimes the learning effect experiences a 100% carryover into the next lot, but other times some learning is forgotten and there is less than a 100% carryover. We consider processes in which the learning effect is completely forgotten from lot to lot. In practice non-linear processes are often treated as linear. That is, the production data are collected and aggregated over time and an average production rate is calculated which leads to inaccuracies in the production schedule. Here we use a discretised linear model to approximate the non-linear process. Production occurs in discrete time periods within which the amount produced is known. This enables a production schedule to be determined that minimises production and holding costs. A dynamic programming model that starts with the latest demand and progresses towards the earliest demand is used to solve the single-product single-machine problem. The model is tested using the production function from the PR#2 grinding process at CTS Reeves, a manufacturing firm in Carlisle, Pa. Solution times are determined for 50, 100, 200, 500, 1500, and 3000 periods.

UR - http://www.scopus.com/inward/record.url?scp=77951116054&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951116054&partnerID=8YFLogxK

U2 - 10.1080/00207540802684726

DO - 10.1080/00207540802684726

M3 - Article

AN - SCOPUS:77951116054

VL - 48

SP - 2279

EP - 2295

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 8

ER -