{"id":"W2064816527","doi":"10.1016/j.disopt.2008.04.001","title":"The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":118,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Tardiness; Travelling salesman problem; Sequence (biology); Mathematical optimization; Single-machine scheduling; Scheduling (production processes); Computation; Branch and bound; Integer programming; Computer science; Job shop scheduling; Linear programming relaxation; Mathematics; Algorithm; Schedule","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002673312,0.00208024,0.002535719,0.00123542,0.0009055759,0.002814088,0.003330152,0.003839406,0.006948476],"category_scores_gemma":[0.01240459,0.001880243,0.001736518,0.004174615,0.001999837,0.006109382,0.001489037,0.00385566,0.0008245819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002094117,"about_ca_system_score_gemma":0.002079139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003090469,"about_ca_topic_score_gemma":0.002728084,"domain_scores_codex":[0.9979556,0.0009536584,0.00007583642,0.0004510066,0.0003973579,0.0001665943],"domain_scores_gemma":[0.9939566,0.004388363,0.0007395567,0.0002449472,0.000341601,0.0003289433],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002654161,0.0001762959,0.0004195914,0.0004395203,0.0001085767,0.0002158713,0.00008084088,0.784559,0.0009366754,0.1837938,0.006006368,0.02299796],"study_design_scores_gemma":[0.00003603581,0.00005177826,0.000247238,0.00002054255,0.00002657968,0.00006280094,0.00003922618,0.8890653,0.0002846745,0.108014,0.002127706,0.00002402756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04344192,0.005513518,0.933295,0.002469488,0.0007294106,0.0001213944,0.0005899072,0.0001577281,0.01368177],"genre_scores_gemma":[0.7128755,0.01140121,0.2319203,0.0007173455,0.002112253,0.0005722821,0.00160634,0.0003849936,0.03840976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006948476,"threshold_uncertainty_score":0.02324498,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01172588068999795,"score_gpt":0.1993286561662797,"score_spread":0.1876027754762818,"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."}}