{"id":"W4385768749","doi":"10.1080/00207543.2023.2230489","title":"Integrated job-shop scheduling in an FMS with heterogeneous transporters: MILP formulation, constraint programming, and branch-and-bound","year":2023,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University; HEC Montréal","funders":"","keywords":"Integer programming; Job shop scheduling; Scheduling (production processes); Mathematical optimization; Computer science; Homogeneous; Constraint programming; Branch and bound; Linear programming; Upper and lower bounds; Bounding overwatch; Distributed computing; Mathematics; Schedule; Artificial intelligence; Stochastic programming","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.001121999,0.0001019563,0.0001383244,0.000854917,0.00006603897,0.0001861126,0.0001435565,0.00005937924,0.00001615963],"category_scores_gemma":[0.00009200969,0.00008781365,0.00002321552,0.000516007,0.0001185232,0.0004300691,0.00001323394,0.0004191645,0.000002472116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000932338,"about_ca_system_score_gemma":0.00007001828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001593397,"about_ca_topic_score_gemma":0.00006784582,"domain_scores_codex":[0.9986214,0.00004570368,0.0003694633,0.0001752434,0.0005839657,0.0002041938],"domain_scores_gemma":[0.9987658,0.00003969423,0.00005776582,0.00007923177,0.0009515117,0.0001060508],"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.0003606048,0.0001038901,0.0486674,0.00007826474,0.0002439765,0.0001964431,0.004157676,0.8266597,0.006391518,0.0003274071,0.00002550362,0.1127876],"study_design_scores_gemma":[0.003680904,0.0008165703,0.03220544,0.0008788309,0.00003429829,0.002288729,0.006767018,0.934301,0.0158927,0.001297356,0.001273363,0.0005638496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9916461,0.0001820931,0.006631763,0.0008755213,0.0004177075,0.0001566854,0.000002941257,0.00006795984,0.00001920205],"genre_scores_gemma":[0.986185,0.0002729263,0.01317703,0.00000804954,0.0002676609,0.00001006762,0.00001898883,0.00002251292,0.00003777752],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1122238,"threshold_uncertainty_score":0.3580937,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05718571718002383,"score_gpt":0.3449578813092621,"score_spread":0.2877721641292383,"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."}}