{"id":"W2131433807","doi":"10.1109/tsm.2002.801379","title":"Optimal scheduling techniques for cluster tools with process-module and transport-module residency constraints","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Semiconductor Manufacturing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":59,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Correctness; Heuristics; Computer science; Scheduling (production processes); Process (computing); Turnaround time; Mathematical optimization; Linear programming; Benchmark (surveying); Distributed computing; Algorithm; Mathematics; Programming language","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.0001159404,0.0003587225,0.000302898,0.0002324922,0.0002351915,0.00009942165,0.000143784,0.0001890313,0.0002339294],"category_scores_gemma":[0.000005200535,0.0003430385,0.00008655537,0.0001167724,0.0001212178,0.0005856027,7.467328e-7,0.0003958541,0.000008711151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006734136,"about_ca_system_score_gemma":0.00001873788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003654924,"about_ca_topic_score_gemma":0.00001008534,"domain_scores_codex":[0.9985815,0.0000131904,0.0003529652,0.0004381253,0.0002023526,0.0004118474],"domain_scores_gemma":[0.9993487,0.0001245714,0.00005241417,0.0002541815,0.00006537479,0.0001547791],"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.00006607623,0.00006809641,0.00001588501,0.0002716106,0.0001207516,0.000005527724,0.0008501919,0.9616795,0.003397389,0.000007572932,0.00001882047,0.03349864],"study_design_scores_gemma":[0.001122597,0.0001364021,0.000031805,0.0002655197,0.00008776726,0.00007947045,0.0003263534,0.1937532,0.8034979,0.00004143137,0.00007989991,0.000577725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.460635,0.00006730303,0.5378302,0.00004915015,0.0001923183,0.0004178486,0.00005800063,0.0005872471,0.0001629357],"genre_scores_gemma":[0.7969549,0.00009129785,0.2024311,0.0000602105,0.00007965191,0.0001644574,0.000006718755,0.00008688098,0.0001248033],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8001004,"threshold_uncertainty_score":0.9999022,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02315621893148915,"score_gpt":0.2367710621200897,"score_spread":0.2136148431886005,"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."}}