MétaCan
Menu
Back to cohort
Record W2082167717 · doi:10.1108/17410390610658513

Supply/demand chain modeling utilizing logistical‐based costing

2006· article· en· W2082167717 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueJournal of Enterprise Information Management · 2006
Typearticle
Languageen
FieldBusiness, Management and Accounting
TopicLife Cycle Costing Analysis
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsActivity-based costingContainer (type theory)Supply chainFactory (object-oriented programming)Computer scienceOperations researchManufacturing engineeringIndustrial engineeringEngineeringBusiness

Abstract

fetched live from OpenAlex

Purpose The purpose of this research is to describe how total cost concept with logistical based costing (LBC) is developed in detail and then used to build logistical models on the Microsoft Excel ™ platform that are integrated from the customer's factory to the supplier's door. Design/methodology/approach The models developed in this project are deterministic, event‐based algorithms to compare logistical conduits for bulk and containerized commodities. The demand chain approach is used to derive the pathways in reverse order from the customer to the supplier. The methodology is necessary to find all possible conduits from origin to destination, including points where product may cross over between various logistics systems. The approach is applied to the bulk and container system with disconnects (elevators, ports) serving as the demarcation points. The pathways from supplier to end‐user must be identified prior to application of classification and costing techniques. A goal of this research was to compare the per unit cost of two different logistical systems – bulk versus container – in two case studies. The first case study was for a miller in Northern China and the second was for a mill in Helsinki, Finland. Findings The spreadsheet models produced results that were within 3 percent of real world costs. Each demand chain was shown to be unique and required customized cost functions to properly configure algorithms. Research limitations/implications The paper suggests that, while a core algorithm may exist for all supply/demand chains, no one particular algorithm configuration suffices. Each supply/demand chain is unique, in terms of both costs and performance. The use of modular cost functions provides the customization necessary to address this issue. Practical implications This project verifies that successful implementation of a model is dependent on following a set of procedures that begins with a clear statement of what the model is to measure, along with what is to be included and what are the constraints imposed on the algorithm. Mapping the flow of the goods through logistical systems provides visibility as to where costs are incurred and how they are to be assigned to the supplier or customer. An improperly assigned variable in the early stages of a supply/demand chain reduces accuracy of subsequent calculations. LBC increases the precision of models by properly establishing the configuration of cost drivers for each stage of the supply/demand chain by avoiding the use of the cost averaging used in statistical analysis. Originality/value This paper provides a standardized approach for mapping, costing and building global supply/demand chain models. The ultimate customer, once thought of as the “end of the line”, now dictates the cost and performance requirements of logistical conduits. While this paper encapsulates methods for building total cost models from the customer's perspective, other configurations can be readily constructed to examine physical and performance characteristics.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.888
Threshold uncertainty score0.773

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.003
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.016
GPT teacher head0.228
Teacher spread0.212 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it