{"id":"W1975764103","doi":"10.1504/ijor.2010.032422","title":"Mathematical formulations for scheduling in manufacturing cells with limited capacity buffers","year":2010,"lang":"en","type":"article","venue":"International Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Job shop scheduling; Scheduling (production processes); Integer programming; Distributed computing; Automation; Flexible manufacturing system; Mathematical optimization; Job shop; Heuristic; Deadlock prevention algorithms; Cellular manufacturing; Operations research; Industrial engineering; Deadlock; Flow shop scheduling; Engineering; Artificial intelligence; Computer network; 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":[],"consensus_categories":[],"category_scores_codex":[0.001075345,0.0000942601,0.0001318419,0.0005643148,0.00008275356,0.0001843631,0.0003216557,0.00008011827,0.0001653505],"category_scores_gemma":[0.0003867171,0.00007858694,0.00005550548,0.0001423405,0.0000619063,0.0003873712,0.00002088382,0.0006915139,0.00001186706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001238353,"about_ca_system_score_gemma":0.0001299821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004534298,"about_ca_topic_score_gemma":0.00002859372,"domain_scores_codex":[0.9984025,0.0000274503,0.0004089948,0.0001004212,0.0008563087,0.0002042707],"domain_scores_gemma":[0.9979628,0.000547468,0.00004772824,0.00008300121,0.001257774,0.0001011864],"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.00009219412,0.00009097343,0.0003758968,0.00001769254,0.00008594376,0.00001427813,0.0003347463,0.9744999,0.01455983,0.0085116,0.00008210041,0.001334855],"study_design_scores_gemma":[0.00133468,0.00007740084,0.00125447,0.00009682622,0.000005698929,0.0001041319,0.0001530208,0.9352021,0.05804525,0.003091291,0.0004992174,0.00013592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8195572,0.00001131455,0.1783973,0.0007368881,0.0004965233,0.0001674193,0.00001532003,0.00001737238,0.0006006393],"genre_scores_gemma":[0.7282959,0.00000995454,0.2712647,0.0000224048,0.000319271,0.00001563119,0.00001024683,0.00001713799,0.00004469787],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0928674,"threshold_uncertainty_score":0.3204682,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05404832010836209,"score_gpt":0.3439403389359244,"score_spread":0.2898920188275623,"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."}}