Linear programming embedded particle swarm optimization for solving an extended model of dynamic virtual cellular manufacturing systems
Bibliographic record
Abstract
The concept of virtual cellular manufacturing system (VCMS) is finding acceptance among researchers as an extension to group technology. In fact, in order to realize benefits of cellular manufacturing system in the functional layout, the VCMS creates provisional groups of resources (machines, parts and workers) in the production planning and control system. This paper develops a mathematical model to design the VCMS under a dynamic environment with a more integrated approach where production planning, system reconfiguration and workforce requirements decisions are incorporated. The advantages of the proposed model are as follows: considering the operations sequence, alternative process plans for part types, machine timecapacity, worker time‐capacity, cross training, lot splitting, maximal cell size, balanced workload for cells and workers. An efficient linear programming embedded particle swarm optimization algorithm is used to solve the proposed model. The algorithm searches over the 0‐1 integer variables and for each 0‐1 integer solution visited; corresponding values of integer variables are determined by solving a linear programming sub‐problem using the simplex algorithm. Numerical examples show that the proposed method is efficient and effective in searching for near optimal solutions.
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.001 | 0.001 |
| 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".