A line balancing problem with parallel workers and cycle time minimization
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.
Bibliographic record
Abstract
We study the problem of balancing assembly lines with parallel workers, motivated by features observed at a third-party logistics provider. The assembly line differs from the two known types of line balancing problems in the literature since it determines simultaneously the line cycle time and the number of workers per station. Furthermore, each station can be occupied by more than one worker and a restriction on the minimum number of stations is imposed. This new type of line balancing problem minimizes the line cycle time, where two types of decisions must be made: how to group the tasks into stations and how many workers to assign to each station. We adapt mathematical models based on assembly line balancing problems with parallel stations. Furthermore, we propose a new model based on network flow formulations for the special case of lines with a serial task structure, frequently observed at the company. We perform an extensive computational study with realistic instances in order to compare the speed of solving different formulations, which is important as such a problem is at the operational level. We also provide a sensitivity analysis of key parameters aiming to better understand the trade-offs and provide meaningful managerial insights.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it