{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001385053,0.0003380955,0.0004025654,0.0003296462,0.00006085707,0.000145887,0.0001247288,0.0003575225,0.00005934897],"category_scores_gemma":[0.00001470557,0.000360912,0.00004599783,0.0001364698,0.00001929142,0.0001202734,0.0000123796,0.0004752578,0.00002454185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001690215,"about_ca_system_score_gemma":0.00003813934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002172335,"about_ca_topic_score_gemma":0.0002901466,"domain_scores_codex":[0.9987454,0.00001623574,0.0004266068,0.0003149657,0.00020115,0.0002956327],"domain_scores_gemma":[0.9996049,0.00003225076,0.00005233891,0.0001741992,0.00003656967,0.00009967339],"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.000005828638,0.00001380844,0.00004310233,0.0007661023,0.00004149288,0.00001582645,0.0005358832,0.9947614,0.00001816966,0.0005068933,0.000008940598,0.003282538],"study_design_scores_gemma":[0.0006264725,0.00001079565,0.001081152,0.0007272375,0.00002522165,0.00001321464,0.003241695,0.9915302,0.00183784,0.000245682,0.00006635481,0.0005941024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8720971,0.01136107,0.05919617,0.00003876912,0.006710076,0.001184893,0.00004539463,0.002315454,0.04705109],"genre_scores_gemma":[0.7186353,0.001475879,0.2718318,0.00003327564,0.0005334492,0.0001321245,0.001831592,0.0003264015,0.005200231],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2126356,"threshold_uncertainty_score":0.9998843,"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."}}