{"id":"W2002455648","doi":"10.1016/s0305-0483(01)00048-2","title":"Heuristic algorithms for the two-machine flowshop with limited machine availability","year":2001,"lang":"en","type":"article","venue":"Omega","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":75,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Job shop scheduling; Computer science; Heuristic; Mathematical optimization; Constructive; Algorithm; Scheduling (production processes); Mathematics; Artificial intelligence; Schedule; Process (computing)","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.0002640909,0.0002020023,0.0001848816,0.000061699,0.0001669744,0.00006576355,0.0002045822,0.00005404569,0.0001558994],"category_scores_gemma":[0.0001111767,0.0001326361,0.00006326018,0.0003845957,0.00005342649,0.0000756862,0.00001938499,0.0001958036,0.00004455157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004742101,"about_ca_system_score_gemma":0.00001557768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000426055,"about_ca_topic_score_gemma":0.00007129846,"domain_scores_codex":[0.9990706,0.00002062607,0.0002137949,0.0002302947,0.0001713412,0.0002932796],"domain_scores_gemma":[0.9990483,0.0003071459,0.00002948013,0.0004293423,0.00009167846,0.0000940584],"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.0001041485,0.00008777485,0.002171343,0.00005053724,0.0001444793,0.0000123557,0.0002035262,0.9504374,0.00006142741,0.0001272374,0.0007638393,0.04583596],"study_design_scores_gemma":[0.001092002,0.00005904867,0.0006451265,0.00001219533,0.0000483443,0.00002806585,0.00002724091,0.9838952,0.0001150455,0.00005314553,0.01382355,0.0002010472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01611933,0.001819318,0.9764962,0.000675951,0.0006817782,0.0005776016,0.00008559234,0.0007975404,0.002746683],"genre_scores_gemma":[0.8387725,0.0002764334,0.1577042,0.0003040398,0.0004642374,0.0001843585,0.0001515263,0.000124111,0.002018553],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8226532,"threshold_uncertainty_score":0.5408741,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01634579333903639,"score_gpt":0.2402695771085099,"score_spread":0.2239237837694735,"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."}}