{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004284571,0.001773209,0.00471219,0.001142372,0.001427774,0.002298608,0.003663225,0.003291415,0.004833683],"category_scores_gemma":[0.01193025,0.002288276,0.001707101,0.002020095,0.001740898,0.003585771,0.00257118,0.001947274,0.0004897444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001080882,"about_ca_system_score_gemma":0.001200469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001586547,"about_ca_topic_score_gemma":0.00150978,"domain_scores_codex":[0.9973749,0.001341045,0.000136542,0.0004199989,0.0002640705,0.0004634896],"domain_scores_gemma":[0.9805723,0.01517388,0.001351307,0.00100422,0.0006706685,0.001227731],"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.001392296,0.0002559359,0.0009608819,0.0004365248,0.0001375581,0.0008132081,0.0001092915,0.9599959,0.003018461,0.01991026,0.001592795,0.01137697],"study_design_scores_gemma":[0.0002008216,0.0001418739,0.0003331295,0.00001044249,0.00002218562,0.000104532,0.00002423088,0.9785379,0.0003834957,0.01987617,0.0003449288,0.00002025489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3071305,0.001418208,0.6836364,0.001016762,0.0003218002,0.0003159104,0.0009862926,0.0007798007,0.004394349],"genre_scores_gemma":[0.9126911,0.0003944974,0.08184917,0.000132596,0.0001860535,0.0002503545,0.0004872934,0.0001270333,0.003881956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004833683,"threshold_uncertainty_score":0.0226593,"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."}}