{"id":"W2047449665","doi":"10.1002/nav.20121","title":"A branch‐and‐cut algorithm for the quay crane scheduling problem in a container terminal","year":2005,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":220,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"Canada Research Chairs","keywords":"Idle; Scheduling (production processes); Computer science; Exploit; Job shop scheduling; Mathematical optimization; Container (type theory); Algorithm; Operations research; Routing (electronic design automation); Mathematics; Engineering; Computer network; Mechanical engineering","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.002339933,0.0002060725,0.000275814,0.000190369,0.0002205882,0.0001699006,0.0003206863,0.0001702746,0.00007924662],"category_scores_gemma":[0.001127414,0.000155756,0.00005904224,0.0002577735,0.0003582445,0.00007762523,0.000120698,0.000881971,0.00002268966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001586846,"about_ca_system_score_gemma":0.0001096768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003387738,"about_ca_topic_score_gemma":0.0006050514,"domain_scores_codex":[0.9978319,0.00007177453,0.0004101519,0.0002996938,0.0005178499,0.0008686626],"domain_scores_gemma":[0.9975808,0.001659718,0.00002983706,0.0003045447,0.0002597296,0.0001654186],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001060464,0.000166402,0.0006430139,0.0004811413,0.00008516311,0.0001625185,0.0005976421,0.05321056,0.0004363843,0.01695271,0.003643883,0.9235145],"study_design_scores_gemma":[0.0009867597,0.0001596623,0.0006664317,0.00008240802,0.00002021287,0.00003814793,0.0001287187,0.9341826,0.0002002636,0.004809661,0.05847387,0.0002512421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004010217,0.003803972,0.9761238,0.001790984,0.0002833891,0.001953474,0.0001814508,0.0002100372,0.01164266],"genre_scores_gemma":[0.9498138,0.0006196823,0.04716796,0.00007705312,0.0007293099,0.0002545236,0.00002338346,0.00005735453,0.001256967],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9458035,"threshold_uncertainty_score":0.6351544,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06578689733596091,"score_gpt":0.3504564598251912,"score_spread":0.2846695624892304,"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."}}