{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001712533,0.0001674525,0.0003077891,0.0004918968,0.0001649062,0.0002328073,0.0003564045,0.0001230521,0.00009810016],"category_scores_gemma":[0.000216106,0.0001295305,0.0000682168,0.0005248117,0.00009015369,0.0001996792,0.00005760448,0.001244678,0.00001129381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008500063,"about_ca_system_score_gemma":0.0001525008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006593049,"about_ca_topic_score_gemma":0.000005088182,"domain_scores_codex":[0.9979071,0.00004883584,0.000563473,0.0001200402,0.0009205424,0.0004400264],"domain_scores_gemma":[0.9983228,0.0002196682,0.0001523636,0.0002453144,0.0008107476,0.0002491426],"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.00001383983,0.0003387766,0.0001656174,0.0004892091,0.0001741051,0.0001865066,0.001470615,0.9262211,0.04741389,0.00009032535,0.0000228567,0.0234132],"study_design_scores_gemma":[0.0005077717,0.0001135485,0.00001735701,0.000306993,0.00002567826,0.0009082295,0.0004349611,0.988893,0.007060921,0.001515218,0.00005286109,0.0001634226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3065916,0.0003254758,0.6922121,0.00005558566,0.0002328198,0.0001407948,0.000002235113,0.00005308342,0.0003862838],"genre_scores_gemma":[0.08774337,0.00004437487,0.9118366,0.000004622821,0.000255213,0.000002887972,7.362533e-7,0.00007607562,0.00003610957],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2196245,"threshold_uncertainty_score":0.5407577,"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."}}