{"id":"W2136004943","doi":"10.1007/s10951-009-0139-3","title":"Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerstwo Edukacji i Nauki","keywords":"Job shop scheduling; Minification; Computer science; Time complexity; Scheduling (production processes); Schedule; Mathematical optimization; Running time; Single-machine scheduling; Algorithm; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.0004170946,0.0001957379,0.0003955596,0.0004413743,0.00004476043,0.0000603771,0.0001636892,0.00012896,0.00001976811],"category_scores_gemma":[0.0002288708,0.0001857755,0.00008658102,0.0003145493,0.00002786622,0.0002466909,0.00001221537,0.0003379486,0.000004415144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005683763,"about_ca_system_score_gemma":0.0000243574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001480761,"about_ca_topic_score_gemma":9.612268e-7,"domain_scores_codex":[0.9985685,0.00003907953,0.0007427884,0.0001365182,0.0002942788,0.0002187907],"domain_scores_gemma":[0.9992533,0.00009745311,0.0002628431,0.0001189473,0.0001499906,0.0001174665],"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.00006093325,0.0001432575,0.001005793,0.00003401539,0.00002616145,0.00001367585,0.0003714169,0.9788566,0.01038412,0.00004929194,0.000004098206,0.009050639],"study_design_scores_gemma":[0.001680945,0.0002068399,0.003612779,0.0004296248,0.00003298557,0.00004877599,0.0001987416,0.9886525,0.004852021,0.00007436706,0.0000125767,0.0001978237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9032843,0.001584872,0.09421899,0.0002544437,0.0002831524,0.00009593695,0.000002144189,0.00006024,0.0002158912],"genre_scores_gemma":[0.5967784,0.0001559181,0.4028341,0.0000620766,0.0001247872,4.53529e-7,0.000002064145,0.00002117307,0.00002102581],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3086151,"threshold_uncertainty_score":0.7575703,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02240112904978402,"score_gpt":0.2536726972704223,"score_spread":0.2312715682206383,"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."}}