{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002460116,0.0002848532,0.0002022007,0.00007219983,0.0005810566,0.0001919867,0.0001740354,0.0001044534,0.00004050029],"category_scores_gemma":[0.00002839473,0.0002117633,0.00003384281,0.0002644313,0.0001213549,0.000329369,0.00003874699,0.0002278657,0.00001726554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007847133,"about_ca_system_score_gemma":0.00003629341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001628321,"about_ca_topic_score_gemma":0.00001759303,"domain_scores_codex":[0.9985631,0.00005038154,0.0003517607,0.0003339689,0.000344485,0.0003563243],"domain_scores_gemma":[0.9993445,0.00006695664,0.00009761749,0.0002505655,0.0001164729,0.0001239485],"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.00001617408,0.00001536477,0.0002440248,0.00003061182,0.00004728239,0.000007513815,0.0005149206,0.9976181,0.0004549061,0.00006309851,0.000008551435,0.0009794261],"study_design_scores_gemma":[0.0005595281,0.00007166697,0.00001871623,0.00008681413,0.00003428416,0.0001285756,0.000116456,0.9975072,0.001081247,0.00004465852,0.00003159177,0.0003193356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01241708,0.001326781,0.9811237,0.0002417907,0.0001222928,0.0006192916,0.00002495681,0.000698143,0.003425999],"genre_scores_gemma":[0.5418719,0.001262103,0.4552725,0.0000438612,0.00009265327,0.0000771334,0.000242617,0.0001393104,0.0009978941],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5294548,"threshold_uncertainty_score":0.8635458,"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."}}