{"id":"W4286513993","doi":"10.1016/j.cie.2022.108487","title":"Mathematical model and simulated annealing algorithm for setup operator constrained flexible job shop scheduling problem","year":2022,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Job shop scheduling; Call for bids; Automation; Scheduling (production processes); Computer science; Operator (biology); Industrial engineering; Simulated annealing; Process (computing); Mathematical optimization; Algorithm; Procurement; Engineering; Mechanical engineering; Schedule; Mathematics; Operating system","routes":{"ca_aff":true,"ca_fund":true,"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.0003964324,0.0003136244,0.0003883698,0.0002239294,0.0002613665,0.0001567449,0.0002193252,0.0001628496,0.00002449111],"category_scores_gemma":[0.00005448462,0.0003747693,0.00008783839,0.0003739232,0.00002697342,0.0001567218,0.0001319604,0.0005528975,0.000001671645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001406098,"about_ca_system_score_gemma":0.00006945007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001783844,"about_ca_topic_score_gemma":4.642873e-8,"domain_scores_codex":[0.9984753,0.0000197351,0.0004761209,0.0003342329,0.000224269,0.0004704146],"domain_scores_gemma":[0.9993124,0.0002002501,0.00004255246,0.0001804764,0.00006015902,0.000204144],"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.00000773079,0.00001353551,0.000003888333,0.00004955179,0.0000846445,0.000004669553,0.0002597198,0.9859218,0.0003747834,0.0004800624,0.00009029887,0.0127093],"study_design_scores_gemma":[0.001912456,0.00005830904,4.349627e-7,0.0000744268,0.0000361106,0.00002921786,0.0001306821,0.9966615,0.0003920584,0.0000735986,0.0002137684,0.0004173815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03244702,0.0001782089,0.964733,0.00006359894,0.0007674062,0.0006088153,0.00007994416,0.001074869,0.00004711152],"genre_scores_gemma":[0.1305974,0.000007531035,0.868491,0.00005162125,0.0004675107,0.0001089627,0.00008922534,0.0001326235,0.00005414529],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09815039,"threshold_uncertainty_score":0.9998704,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02863278429937791,"score_gpt":0.2322161997190361,"score_spread":0.2035834154196582,"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."}}