{"id":"W255402503","doi":"10.1007/s00170-015-7080-8","title":"An improved model and novel simulated annealing for distributed job shop problems","year":2015,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Simulated annealing; Mathematical optimization; Metaheuristic; Computer science; Greedy algorithm; Job shop scheduling; Scheduling (production processes); Integer programming; Local search (optimization); Taguchi methods; Algorithm; Mathematics; Schedule; Machine learning","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.0006747967,0.0006374595,0.00139307,0.0004767742,0.0005468793,0.001015399,0.00210277,0.001513002,0.003370389],"category_scores_gemma":[0.0015661,0.0006210482,0.001296901,0.0007957751,0.0006513741,0.0009171234,0.0009948688,0.001461213,0.0005356052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009273827,"about_ca_system_score_gemma":0.001540087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006100961,"about_ca_topic_score_gemma":0.00618127,"domain_scores_codex":[0.9994513,0.0002221087,0.00002121272,0.00008096349,0.0001605727,0.0000638053],"domain_scores_gemma":[0.9994445,0.0002834132,0.00004407857,0.00008170493,0.0001059622,0.00004026994],"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.00002673314,0.00002095105,0.00005679141,0.0000197106,0.000010406,0.00001788185,0.000009146615,0.9902002,0.0007765201,0.005646433,0.0002674229,0.002947837],"study_design_scores_gemma":[0.000006135476,0.000007883781,0.00001491021,8.220339e-7,0.000002495149,0.000003590925,9.486734e-7,0.9985278,0.00006930312,0.001131131,0.0002333344,0.000001731206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01891976,0.0002876247,0.974418,0.0002178164,0.0001513435,0.00006495426,0.0001012046,0.0003180407,0.005521248],"genre_scores_gemma":[0.6441931,0.0004347106,0.3435837,0.0001598461,0.0001613327,0.0003886949,0.0002529563,0.0002627156,0.01056294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006100961,"threshold_uncertainty_score":0.01213086,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01795030455398187,"score_gpt":0.2632512223375084,"score_spread":0.2453009177835266,"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."}}