Premium
A Technique for Order Placement and Sizing
Author(s) -
Coleman B. Jay,
McKnew Mark A.
Publication year - 1990
Publication title -
journal of purchasing and materials management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.75
H-Index - 92
eISSN - 1745-493X
pISSN - 0094-8594
DOI - 10.1111/j.1745-493x.1990.tb00503.x
Subject(s) - sizing , computer science , schedule , heuristic , process (computing) , order (exchange) , operations research , heuristics , sample (material) , mathematical optimization , industrial engineering , artificial intelligence , mathematics , engineering , economics , chemistry , finance , art , chromatography , visual arts , operating system
This article presents a unique heuristic model for purchased item lot‐sizing. The model subsequently is tested using 20 historically popular sample problems. The development of heuristic lot‐sizing models was initiated as a result of difficulties identified during evaluation of the multi‐level lot‐sizing problem encountered in using material requirements planning systems. The “technique for order placement and sizing” (TOPS) is based on the logic of the “incremental part‐period algorithm,” and incorporates four distinct phases. It compares incremental costs and benefits of revising an initial order release schedule by inserting new orders or shifting existing ones. Results of an experimental process exhibited single‐line optimal solutions for all test cases. Additionally, execution times were similar to much simpler but less accurate techniques than those of the optimizing Wagner‐Whitin routine.