{"id":"W4212934617","doi":"10.1016/j.cor.2022.105738","title":"A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Transport Canada","funders":"Shanghai Jiao Tong University; National Natural Science Foundation of China","keywords":"Computer science; Preventive maintenance; Variable neighborhood search; Algorithm; Scheduling (production processes); Variable (mathematics); Mathematical optimization; Mathematics; Reliability engineering; Metaheuristic; Engineering","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.001520764,0.0001957862,0.0002814733,0.0004035888,0.00210073,0.0003039232,0.0002705674,0.00004695759,0.00014524],"category_scores_gemma":[0.00006260841,0.0002177099,0.00005532617,0.0007892472,0.0001076019,0.0002135625,0.0003029681,0.0007503305,0.000005140531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003160839,"about_ca_system_score_gemma":0.0004303424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000219976,"about_ca_topic_score_gemma":0.0000373152,"domain_scores_codex":[0.9976726,0.0003532684,0.0003999258,0.0004473513,0.0004279778,0.0006988739],"domain_scores_gemma":[0.9988188,0.0002717994,0.00002058156,0.000274428,0.0003289435,0.0002855149],"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.000007340808,0.00008204713,0.000025697,0.00006198818,0.00008328685,0.000004365409,0.000840893,0.980453,0.00009911109,0.007472126,0.0007977683,0.01007237],"study_design_scores_gemma":[0.001235037,0.0002155495,0.00002789069,0.0000487514,0.00000659105,0.00005515851,0.0004297451,0.9960171,0.00003678636,0.0006229792,0.001090916,0.0002135154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001561636,0.001628017,0.9926131,0.001520873,0.0002540362,0.001528332,0.0004672385,0.000236233,0.0001904901],"genre_scores_gemma":[0.05524478,0.0001987178,0.9417009,0.0002211996,0.0001348987,0.001126844,0.0006434791,0.00006677947,0.0006623681],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05368314,"threshold_uncertainty_score":0.9991984,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03132111588243822,"score_gpt":0.3209983998812939,"score_spread":0.2896772839988557,"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."}}