{"id":"W2041970045","doi":"10.1016/j.ejor.2005.12.013","title":"A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Simulated annealing; Tabu search; Mathematical optimization; Benchmark (surveying); Adaptive simulated annealing; Scheduling (production processes); Job shop scheduling; Parallel computing; Algorithm; Mathematics; Schedule","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017416,0.000489849,0.001106134,0.001356622,0.000482622,0.001166303,0.001475274,0.001777794,0.001932027],"category_scores_gemma":[0.006088255,0.0003797301,0.0007099264,0.001440662,0.0006747864,0.001274141,0.0005246681,0.000759827,0.0001609228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008453776,"about_ca_system_score_gemma":0.0009196518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004800048,"about_ca_topic_score_gemma":0.005678807,"domain_scores_codex":[0.9989483,0.0006191933,0.00003335117,0.00008185259,0.0002150244,0.0001022673],"domain_scores_gemma":[0.9954634,0.003510078,0.0001652783,0.0003364397,0.0003980593,0.0001267914],"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.001039067,0.0004863815,0.002480846,0.0003664121,0.0001998039,0.0001419908,0.0001642616,0.8875805,0.004145492,0.01374553,0.0009042274,0.08874563],"study_design_scores_gemma":[0.00006037213,0.0003704148,0.0008315157,0.00001334967,0.00005244491,0.00005228531,0.00006006798,0.995394,0.001056208,0.001496775,0.0005975109,0.00001515609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5783408,0.004337982,0.3944362,0.0006599667,0.0004265178,0.0001859681,0.0001090254,0.000862779,0.0206407],"genre_scores_gemma":[0.8989918,0.0007097351,0.09847897,0.0000732336,0.00005621959,0.00007037912,0.00005261505,0.0001061615,0.001460768],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004800048,"threshold_uncertainty_score":0.009544253,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09740541192268706,"score_gpt":0.3552729179197325,"score_spread":0.2578675059970454,"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."}}