A variable neighbourhood search for integrated production and preventive maintenance planning in multi-state systems
Bibliographic record
Abstract
This paper presents a variable neighbourhood search (VNS) to the integrated production and maintenance planning problem in multi-state systems. VNS is one of the most recent meta-heuristics used for problem solving in which a systematic change of neighbourhood within a local search is carried out. In the studied problem, production and maintenance decisions are co-ordinated, so that the total expected cost is minimised. We are given a set of products that must be produced in lots on a multi-state production system during a specified finite planning horizon. Planned preventive maintenance and unplanned corrective maintenance can be performed on each component of the multi-state system. The maintenance policy suggests cyclical preventive replacements of components, and a minimal repair on failed components. The objective is to determine an integrated lot-sizing and preventive maintenance strategy of the system that will minimise the sum of preventive and corrective maintenance costs, setup costs, holding costs, backorder costs and production costs, while satisfying the demand for all products over the entire horizon. We model the production system as a multi-state system with binary-state components. The formulated problem can be solved by comparing the results of several multi-product capacitated lot-sizing problems. The proposed VNS deals with the preventive maintenance selection task. Results on test instances show that the VNS method provides a competitive solution quality at economically computational expense in comparison with genetic algorithms.
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.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.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.
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".