{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001139354,0.0009255079,0.001412671,0.000708887,0.001029553,0.00148926,0.001296621,0.001722872,0.00859902],"category_scores_gemma":[0.002003783,0.0007916918,0.0006666572,0.001383733,0.0005443847,0.001458863,0.001155694,0.001462158,0.0008091061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001463589,"about_ca_system_score_gemma":0.00183267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01243066,"about_ca_topic_score_gemma":0.009312788,"domain_scores_codex":[0.9994628,0.0001863584,0.00002597171,0.0001224637,0.00008568412,0.0001167678],"domain_scores_gemma":[0.9988027,0.0008722488,0.00007637633,0.00003707716,0.0001162132,0.00009551468],"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.0003418031,0.0002437744,0.0005240679,0.0002143889,0.00004213496,0.0002112188,0.0001681486,0.8608971,0.002297016,0.01513428,0.007404736,0.1125214],"study_design_scores_gemma":[0.00006755478,0.00004734362,0.00008232758,0.00001115919,0.000009820434,0.00002126553,0.00002718497,0.99303,0.0004728363,0.005047547,0.001176721,0.000006279188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04989672,0.0005320149,0.9384329,0.0007241791,0.00008912534,0.0003394944,0.0004073475,0.0008494928,0.008728702],"genre_scores_gemma":[0.1864457,0.0003627088,0.8060301,0.0001873032,0.00005925645,0.0004321938,0.000957675,0.0002082724,0.00531679],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01243066,"threshold_uncertainty_score":0.02876657,"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."}}