An operating cost minimization model for buyer-vendor coordination batch system with breakdowns, scrap, overtime, and an external source
Bibliographic record
Abstract
When making a batch production decision for a buyer-vendor coordination system, the management must simultaneously consider the operating expenses incurred in in-house manufacturing and inventory, finished goods’ shipping, and stock holding at the retailer end. Achieving the operational goals of desirable quality, minimal production disruption, and shortening fabrication time help minimize overall in-house operating costs and maximize customer satisfaction. This work builds an operating cost minimization model for buyer-vendor coordination batch system with scrap, breakdowns, overtime, multi-shipment, and an external source to assist the management in optimizing their production-delivery plan. Removing inevitable scrap items ensures product quality, and correction action on stochastic equipment breakdown prevents unacceptable production delays. Implementing partial overtime and adopting an external source expedites in-house manufacturing time. Model construction and cost analysis enable us to decide the operating expense function. Then, we verify the function’s convexity and decide our model’s best manufacturing runtime with the differential calculus and a proposed algorithm. Furthermore, the numerical demonstrations are used to exhibit our work’s applicability and show what kinds of crucial in-depth information can be disclosed and made accessible to the production planners for their decision-making.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.007 | 0.001 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".