{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002417981,0.001390939,0.003311143,0.0007067365,0.001449666,0.003022254,0.003267384,0.005039955,0.006909045],"category_scores_gemma":[0.003533651,0.001565246,0.001136102,0.001101661,0.001530345,0.002622147,0.001986364,0.00164816,0.0006022367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001174534,"about_ca_system_score_gemma":0.001547952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003116885,"about_ca_topic_score_gemma":0.002591063,"domain_scores_codex":[0.997926,0.0008090915,0.00009189711,0.0004785655,0.0002567486,0.0004377695],"domain_scores_gemma":[0.9969255,0.001865974,0.0002847757,0.0001355279,0.0001836073,0.0006046511],"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.002280922,0.0006225905,0.001401836,0.0006177961,0.0002107302,0.001917088,0.0002070986,0.9357894,0.007741163,0.02953392,0.002804663,0.01687291],"study_design_scores_gemma":[0.0003033832,0.0003475095,0.0004957338,0.00001664328,0.00005383892,0.0001844151,0.00009278087,0.9849104,0.0008827647,0.01171078,0.0009635084,0.00003817249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.376415,0.001253247,0.5991632,0.002706358,0.0006135571,0.0006368221,0.0008104887,0.0003942641,0.01800696],"genre_scores_gemma":[0.9250566,0.0002658385,0.06184416,0.000202337,0.0001614988,0.0002375049,0.000227485,0.00006018843,0.01194432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006909045,"threshold_uncertainty_score":0.02311307,"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."}}