{"id":"W4390825574","doi":"10.1016/j.jii.2024.100574","title":"The multi-factory two-stage assembly scheduling problem","year":2024,"lang":"en","type":"article","venue":"Journal of Industrial Information Integration","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Université Laval","keywords":"Scheduling (production processes); Factory (object-oriented programming); Job shop scheduling; Computer science; Schedule; Industrial engineering; Integer programming; Flow shop scheduling; Operations research; Distributed computing; Engineering; Operations management; Algorithm; Operating system","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009604458,0.0001207276,0.0001204146,0.0002636756,0.0001320327,0.0007365332,0.0001454769,0.0001346102,0.00002861885],"category_scores_gemma":[0.00031257,0.00007877033,0.00009895842,0.0003330735,0.00002073388,0.002324808,0.000008402394,0.0007022696,0.00005161392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001870045,"about_ca_system_score_gemma":0.0001511134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006306913,"about_ca_topic_score_gemma":0.000005148212,"domain_scores_codex":[0.9986521,0.00003885699,0.000841986,0.00003901402,0.0002957021,0.0001323234],"domain_scores_gemma":[0.9991817,0.0001479785,0.0002006652,0.00008158167,0.0003226372,0.00006545315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002355683,0.000006842793,0.00002028576,0.000016997,0.00007393344,0.000001663314,0.001186431,0.8267879,0.0003106111,0.002243876,0.002231185,0.1670967],"study_design_scores_gemma":[0.0005846292,0.00004553252,0.000006871872,0.0002066686,0.00001912536,0.00002160695,0.001461215,0.97293,0.003889185,0.00004216915,0.02069084,0.0001021562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01941876,0.0004144641,0.9722211,0.0004753459,0.00531916,0.0001988507,0.000009953648,0.0002162499,0.001726131],"genre_scores_gemma":[0.8996934,0.0003614491,0.09743911,0.0001014641,0.001945808,0.00001791143,0.00005435203,0.0000388258,0.0003476441],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8802747,"threshold_uncertainty_score":0.7102407,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03739520205521756,"score_gpt":0.2758884285440117,"score_spread":0.2384932264887942,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}