{"id":"W2065819816","doi":"10.1016/s0377-2217(01)00083-2","title":"Two-machine flow shops with limited machine availability","year":2002,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":116,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Flow shop scheduling; Computer science; Time horizon; Mathematical optimization; Heuristic; Job shop scheduling; Flow (mathematics); Upper and lower bounds; Constant (computer programming); Time complexity; Algorithm; Mathematics; Routing (electronic design automation)","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002746133,0.0001264402,0.0001561975,0.0002680853,0.000187778,0.0001734072,0.0003005231,0.00001781288,0.002365195],"category_scores_gemma":[0.000429565,0.00009432217,0.00005160866,0.0004651864,0.0000912256,0.0002560888,0.00003676204,0.0007947131,0.0003138169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008109382,"about_ca_system_score_gemma":0.00003843294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000205282,"about_ca_topic_score_gemma":0.000003878691,"domain_scores_codex":[0.9977409,0.0005416729,0.0004223877,0.0001347253,0.000910597,0.000249704],"domain_scores_gemma":[0.9984537,0.000194687,0.00003953719,0.0001925241,0.0009061655,0.0002133606],"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.00007037536,0.0001235672,0.0008856449,0.00001570908,0.00007825575,0.0002326995,0.0003894501,0.980944,0.0005040743,0.0001143744,0.004134525,0.01250733],"study_design_scores_gemma":[0.00120834,0.0002884802,0.001359186,0.00004419618,0.000006628663,0.0002032729,0.00004308864,0.991718,0.0003063354,0.000006310463,0.004689152,0.0001270236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3741129,0.01237292,0.348232,0.009591433,0.001474915,0.0008914322,0.0001537395,0.0004694909,0.2527012],"genre_scores_gemma":[0.8810828,0.000228117,0.1169129,0.00007981701,0.0004616133,0.000001443275,0.00001686481,0.00005568695,0.001160709],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5069699,"threshold_uncertainty_score":0.9985468,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05547564325294014,"score_gpt":0.2931843484889926,"score_spread":0.2377087052360525,"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."}}