Um modelo para o problema de dimensionamento e sequenciamento de lotes com aceitação de pedidos
Bibliographic record
Abstract
Este trabalho apresenta um modelo de programac ¸ão inteira mista para o problema de dimensionamento e sequenciamento de lotes integrado ao problema de aceitac ¸ão de pedidos e com a considerac ¸ão da idade dos produtos em estoque.Neste problema, as demandas dos clientes são agregadas em pedidos, os quais podem ou não serem aceitos.Os pedidos devem ser entregues dentro de uma janela de tempo.Os itens são perecíveis e podem permanecer no estoque por um determinado tempo (shelf-life).O objetivo é maximar o lucro gerado pelo atendimento dos pedidos, descontando os custos de estoque e de preparac ¸ão da máquina.Para tratar o problema são desenvolvidas duas heurísticas construtivas.Testes computacionais foram realizados e os resultados obtidos foram analisados.As heurísticas tiveram um desempenho, em média, superior ao branch-and-cut do CPLEX na obtenc ¸ão de soluc ¸ões de boa qualidade, no limite de tempo estabelecido.PALAVRAS CHAVE.Dimensionamento e sequenciamento de lotes, aceitac ¸ão de pedidos, programac ¸ão matemática inteira mista.
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.002 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.005 | 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".