MétaCan
Menu
Back to cohort
Record W2336562797

A Flexible MILP Model for Multiple-Shift Workforce Planning Under Annualized Hours

2008· article· en· W2336562797 on OpenAlexaff
Alain Hertz, Nadia Lahrichi, Marino Widmer

Bibliographic record

VenuePolyPublie (École Polytechnique de Montréal) · 2008
Typearticle
Languageen
FieldDecision Sciences
TopicScheduling and Timetabling Solutions
Canadian institutionsPolytechnique MontréalGroup for Research in Decision Analysis
Fundersnot available
KeywordsOvertimeWorkforceWorkforce planningWorkloadFlexibility (engineering)Linear programmingOperations researchInteger programmingWorkforce managementComputer scienceMathematical optimizationOperations managementLabour economicsEngineeringEconomicsMathematicsAlgorithm
DOInot available

Abstract

fetched live from OpenAlex

Flexibility in workforce planning is one of the best ways to respond to fluctuations of the demand. This paper proposes a flexible mixed integer linear programming (MILP) model to solve a multiple-shift workforce planning problem under annualized working hours. The model takes into account laws and collective agreements that impose constraints on overtime and holidays. We consider possible gradual hiring of full time and partial time workers. Several objectives are pursued such as balancing the workload of the employees or minimizing the workforce size. Computational experiments on a real life problem demonstrate the effectiveness of the model.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.009
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.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.

Opus teacher head0.132
GPT teacher head0.361
Teacher spread0.229 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations0
Published2008
Admission routes1
Has abstractyes

Explore more

Same venuePolyPublie (École Polytechnique de Montréal)Same topicScheduling and Timetabling SolutionsFrench-language works237,207