{"id":"W2106081565","doi":"10.1080/07408170309342349","title":"Optimization-based manufacturing scheduling with multiple resources, setup requirements, and transfer lots","year":2003,"lang":"en","type":"article","venue":"IIE Transactions","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"Capital District Health Authority","funders":"University of Connecticut; University of California, Santa Cruz; National Science Foundation","keywords":"Subgradient method; Mathematical optimization; Schedule; Computer science; Scheduling (production processes); Job shop scheduling; Integer programming; Heuristic; Linear programming; Mathematics","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.0008832588,0.0008737265,0.001258232,0.0004235194,0.0004733828,0.000780755,0.0007583585,0.0008100338,0.001182112],"category_scores_gemma":[0.001472296,0.0007668107,0.0006402599,0.0007498211,0.0008988904,0.0008222932,0.0008009864,0.0009855438,0.0001776071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001083522,"about_ca_system_score_gemma":0.00138602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006320328,"about_ca_topic_score_gemma":0.003982417,"domain_scores_codex":[0.9993229,0.000374147,0.00001944594,0.00008134499,0.0001111025,0.00009111484],"domain_scores_gemma":[0.9992449,0.0004875141,0.0001307149,0.00003847453,0.00004976249,0.00004858981],"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.00003068973,0.00001421353,0.00005812751,0.00001082737,0.000006228834,0.00003397085,0.000007826391,0.9959542,0.0005009552,0.001745945,0.00008064689,0.001556539],"study_design_scores_gemma":[0.000006925121,0.00001113457,0.00002911298,7.936795e-7,0.000001896302,0.000003362723,0.00000188051,0.9990496,0.0001347218,0.0006826352,0.00007644747,0.00000144006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1178736,0.0002817615,0.8772635,0.0003118155,0.00005850888,0.00008603989,0.00006840825,0.0002153466,0.003841017],"genre_scores_gemma":[0.8799436,0.0002288688,0.1163574,0.00004732366,0.00006238513,0.0001236782,0.0001222909,0.00004228022,0.003072114],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006320328,"threshold_uncertainty_score":0.0125671,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0114145999281535,"score_gpt":0.1997551327283588,"score_spread":0.1883405328002053,"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."}}