{"id":"W2147965468","doi":"10.1287/opre.1040.0144","title":"Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach","year":2004,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":88,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Hoist (device); Integer programming; Scheduling (production processes); Schedule; Computer science; Mathematical optimization; Engineering; Algorithm; Mathematics; Operating system; Structural engineering","routes":{"ca_aff":true,"ca_fund":false,"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.0006855113,0.0001603866,0.0001511957,0.0003509178,0.0005093106,0.0004577138,0.0002862647,0.0001347659,0.00005110572],"category_scores_gemma":[0.0002668785,0.0001567676,0.00005849207,0.001004239,0.0001331244,0.0002471207,0.00006760781,0.0006921621,0.000276928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002026434,"about_ca_system_score_gemma":0.0001363031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000984384,"about_ca_topic_score_gemma":0.00006574922,"domain_scores_codex":[0.9983901,0.00007677267,0.0002689973,0.0003072027,0.0004329036,0.0005239972],"domain_scores_gemma":[0.9990844,0.00003685396,0.000006376176,0.0003448763,0.0003411633,0.00018629],"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.00000301924,0.000152065,0.00002095672,0.00002105108,0.00002579074,0.000004271851,0.0007399783,0.9947305,0.0007217336,0.001114436,0.00002673305,0.002439441],"study_design_scores_gemma":[0.0007144619,0.00003373907,0.00004374226,0.00002759778,0.000004613366,0.00001350591,0.001301848,0.9943292,0.002628812,0.000006016457,0.0007054885,0.000190945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09134617,0.0003139299,0.9053591,0.0002395075,0.0001847806,0.0004954273,0.000005802206,0.0004586339,0.00159667],"genre_scores_gemma":[0.4166078,0.00003048325,0.582482,0.00000849899,0.0001079914,0.0002217812,0.00006376131,0.00004074511,0.0004370227],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3252616,"threshold_uncertainty_score":0.6392797,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0718429271301883,"score_gpt":0.3443168042178998,"score_spread":0.2724738770877115,"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."}}