{"id":"W1575325983","doi":"","title":"Shop scheduling in manufacturing systems: algorithms and complexity","year":2004,"lang":"en","type":"dissertation","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Job shop scheduling; Reentrancy; Flow shop scheduling; Travelling salesman problem; Scheduling (production processes); Computer science; Algorithm; Mathematical optimization; Cellular manufacturing; Time complexity; Job shop; Flexible manufacturing system; Minification; Computational complexity theory; Artificial intelligence; Mathematics; Schedule","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.002319755,0.001610387,0.001643733,0.00130976,0.001049407,0.003269531,0.001906449,0.001751601,0.004215294],"category_scores_gemma":[0.007486885,0.0009380352,0.001876385,0.002565879,0.002246359,0.0047751,0.00174853,0.003591218,0.0009747582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003031618,"about_ca_system_score_gemma":0.002334548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003435499,"about_ca_topic_score_gemma":0.002416963,"domain_scores_codex":[0.9979869,0.0007447668,0.0001193482,0.0003614839,0.0005883955,0.0001991284],"domain_scores_gemma":[0.9953328,0.003886685,0.0001759694,0.0003055338,0.0002359297,0.0000631912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007566586,0.0001541736,0.0006621978,0.0008533095,0.000114882,0.0001159914,0.0002438467,0.3495333,0.001187171,0.5187472,0.0111248,0.1171875],"study_design_scores_gemma":[0.00004962066,0.00003021188,0.000192907,0.00004387301,0.00001552347,0.00006314569,0.00003937289,0.5305452,0.0003548253,0.4588284,0.009821347,0.00001561939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01080207,0.007596925,0.9651158,0.002165848,0.0002365917,0.0002296128,0.000385515,0.0004812425,0.01298634],"genre_scores_gemma":[0.2105478,0.01175916,0.7660367,0.000525701,0.001273179,0.0007692361,0.001549704,0.0002813161,0.007257176],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004215294,"threshold_uncertainty_score":0.02199596,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02267646120403355,"score_gpt":0.2501277646010478,"score_spread":0.2274513033970142,"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."}}