{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001098891,0.0008382422,0.001149372,0.0005592563,0.0006220834,0.001385985,0.000963227,0.001095123,0.001861019],"category_scores_gemma":[0.001686583,0.0006137932,0.0007487455,0.001266082,0.0006741433,0.0009669639,0.0007891611,0.0009098332,0.0002308547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001223335,"about_ca_system_score_gemma":0.001712317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008044188,"about_ca_topic_score_gemma":0.007553208,"domain_scores_codex":[0.999432,0.0002456131,0.00001958427,0.000088194,0.0001004266,0.0001141805],"domain_scores_gemma":[0.9993252,0.0004313968,0.00009472271,0.00003372569,0.00005753825,0.00005754819],"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.00003883277,0.00002287025,0.000154709,0.00004162225,0.00001480251,0.00004388093,0.0000120888,0.9905655,0.0004575739,0.003612726,0.0001593848,0.004875968],"study_design_scores_gemma":[0.000004664951,0.00001895,0.00005933875,0.000004318981,0.000005167276,0.000006973258,0.000008668442,0.9980007,0.0001616829,0.001493541,0.0002335898,0.000002331536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05972601,0.000512094,0.9320744,0.0002284121,0.00004968328,0.000113383,0.0001422102,0.0001976889,0.006956154],"genre_scores_gemma":[0.8189294,0.0004422308,0.1776543,0.00007142923,0.00004223825,0.0001628365,0.0001508439,0.00005848573,0.002488145],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008044188,"threshold_uncertainty_score":0.01599473,"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."}}