{"id":"W2081207311","doi":"10.1007/s00170-014-6343-0","title":"Cyclic hybrid flow shop scheduling problem with limited buffers and machine eligibility constraints","year":2014,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Flow shop scheduling; Computer science; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Simulated annealing; Integer programming; Batch production; Operations research; Industrial engineering; Economics; Mathematics; Operations management; Engineering; Algorithm; 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":[],"consensus_categories":[],"category_scores_codex":[0.0002905977,0.0001618988,0.0002102139,0.000285036,0.00007360677,0.00006059953,0.0004697595,0.00006376073,0.00001642011],"category_scores_gemma":[0.0001247731,0.0001123533,0.00003986283,0.00007594923,0.0002525551,0.0001474366,0.00006569332,0.000474559,0.000002462628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007377293,"about_ca_system_score_gemma":0.00001967484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001437244,"about_ca_topic_score_gemma":0.000004298391,"domain_scores_codex":[0.9990763,0.00001817713,0.0003433174,0.0001401106,0.0002447786,0.0001773306],"domain_scores_gemma":[0.9993185,0.0001249935,0.0001676959,0.0001774342,0.0001565823,0.00005480687],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008111711,0.00001907355,0.0003027119,0.00001348178,0.0001717305,0.00002014105,0.00006426608,0.8261427,0.002470732,0.0003142348,0.000007157081,0.1703927],"study_design_scores_gemma":[0.003333761,0.0003046142,0.0007218741,0.0003373302,0.00007251442,0.003303895,0.0003668993,0.4178839,0.5565332,0.01549643,0.001185947,0.0004596322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7727652,0.0001942262,0.2246578,0.00169469,0.000299356,0.00007713622,0.000004193657,0.0001817644,0.0001256975],"genre_scores_gemma":[0.7546239,0.0001336903,0.245076,0.00006863048,0.00006698263,0.000003158067,0.000002585238,0.00001878462,0.000006247644],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5540625,"threshold_uncertainty_score":0.4581634,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006187222570836608,"score_gpt":0.2234527713058268,"score_spread":0.2172655487349902,"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."}}