{"id":"W3162151920","doi":"10.1007/s10878-021-00755-9","title":"A two-machine no-wait flow shop problem with two competing agents","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Job shop scheduling; Theory of computation; Computer science; Flow shop scheduling; Tabu search; Mathematical optimization; Scheduling (production processes); Branch and bound; Upper and lower bounds; Constraint (computer-aided design); Heuristic; Algorithm; Mathematics; 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.0003527067,0.0002010302,0.0003455332,0.0001452537,0.0001036038,0.0001577391,0.0001543619,0.0000734411,0.0002179054],"category_scores_gemma":[0.0001352754,0.0001830325,0.00009139319,0.0005120844,0.00002042693,0.0003686341,0.00002715255,0.0003446699,0.00001023848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001191277,"about_ca_system_score_gemma":0.0001282195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002411976,"about_ca_topic_score_gemma":8.803219e-7,"domain_scores_codex":[0.9984915,0.00009025518,0.0005926559,0.0001372957,0.0004710013,0.0002173175],"domain_scores_gemma":[0.9982643,0.00007530997,0.0002631319,0.0001534383,0.001093858,0.0001500223],"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.0000634562,0.00009317933,0.0002603364,0.00003105365,0.0001081296,0.00005654839,0.0001748193,0.9980989,0.00007776387,0.0003740138,0.0001566523,0.000505113],"study_design_scores_gemma":[0.004786432,0.0001283645,0.000009732818,0.0001720899,0.00007447723,0.0001349384,0.0000725702,0.9931175,0.0007680019,0.0001287972,0.0003925481,0.00021452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005701545,0.0004662525,0.9793496,0.0001986763,0.006736849,0.000187665,0.000007068858,0.0001885205,0.007163864],"genre_scores_gemma":[0.1112038,0.00014104,0.8874543,0.00005530323,0.0009480147,0.000003594753,0.00004977319,0.00007130971,0.00007288062],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1055023,"threshold_uncertainty_score":0.746385,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007408698531007035,"score_gpt":0.2262347254713052,"score_spread":0.2188260269402982,"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."}}