{"id":"W2072214393","doi":"10.5539/jmr.v2n3p57","title":"Solving Single Machine Scheduling Problem with Maximum Lateness Using a Genetic Algorithm","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Single-machine scheduling; Due date; Mathematical optimization; Scheduling (production processes); Algorithm; Genetic algorithm; Job shop scheduling; Computer science; Schedule","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007835721,0.000586471,0.0007634484,0.0004807936,0.0004286076,0.0005556216,0.00070796,0.0009287915,0.001463242],"category_scores_gemma":[0.001411478,0.0003044966,0.0006457363,0.0006360005,0.000389733,0.0004841097,0.0003246921,0.0006698275,0.0001363037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005949198,"about_ca_system_score_gemma":0.001427537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003030788,"about_ca_topic_score_gemma":0.001888509,"domain_scores_codex":[0.9996841,0.00009968858,0.00001317274,0.00006047324,0.00008856582,0.00005401043],"domain_scores_gemma":[0.9995297,0.0002841096,0.00006470246,0.00002918219,0.00006397904,0.00002826744],"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.00005584797,0.00005945122,0.0005058335,0.00005913253,0.00003124934,0.00005199908,0.00004875674,0.9508637,0.006220105,0.003886162,0.0003353216,0.03788243],"study_design_scores_gemma":[0.000025255,0.00004657548,0.0001373702,0.000004086573,0.000009095365,0.00002250517,0.00001104436,0.9959804,0.001479359,0.001983598,0.0002964186,0.000004244616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1571831,0.0003240579,0.8391941,0.0002052894,0.00005736707,0.00008012671,0.00003708682,0.0004108597,0.002508027],"genre_scores_gemma":[0.6142823,0.0002250496,0.3829092,0.0000514248,0.00003916385,0.000142347,0.00009982885,0.00006435718,0.002186325],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003030788,"threshold_uncertainty_score":0.006026268,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04796260677904627,"score_gpt":0.3092873725616972,"score_spread":0.261324765782651,"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."}}