{"id":"W4292646494","doi":"","title":"Configuration of a dynamic MOLS algorithm for Bi-objective flowshop scheduling","year":2019,"lang":"en","type":"other","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scheduling (production processes); Processor scheduling; Dynamic priority scheduling; Algorithm; Parallel computing; Mathematical optimization; Mathematics; Schedule; Operating system","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.001760797,0.0004249526,0.0005739284,0.0005455537,0.000168772,0.0001887194,0.001484435,0.0003522106,0.0001273329],"category_scores_gemma":[0.0009841095,0.0004692245,0.000232285,0.0007687514,0.000226325,0.0003411624,0.0003859416,0.0002971323,0.00006328056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001807908,"about_ca_system_score_gemma":0.0003727388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002021114,"about_ca_topic_score_gemma":0.0002125596,"domain_scores_codex":[0.9961285,0.00141613,0.0005617019,0.001053604,0.0004552096,0.0003848545],"domain_scores_gemma":[0.9930534,0.001195294,0.001046483,0.002054536,0.002522944,0.0001273952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001743708,0.0007272338,0.00001017069,0.0002922171,0.0003188417,0.000003592138,0.004708793,0.001520906,0.002959398,0.11295,0.002824732,0.8736666],"study_design_scores_gemma":[0.001716594,0.00000198334,0.00002832636,0.001188313,0.00003497673,0.000007458469,0.00008996746,0.95947,0.01406725,0.001067397,0.02176296,0.0005647558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000006773339,0.0005818958,0.8784465,0.0005490176,0.0003707379,0.001424742,0.0001403579,0.0003865813,0.1180934],"genre_scores_gemma":[0.0006174872,0.0002188802,0.7654005,0.00004230082,0.00002200662,0.000146172,0.0002735716,0.0002035618,0.2330755],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9579491,"threshold_uncertainty_score":0.9997759,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008833880944187689,"score_gpt":0.243714623297784,"score_spread":0.2348807423535964,"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."}}