{"id":"W3117209446","doi":"10.18280/jesa.530617","title":"A Two-Stage Optimization Algorithm for Multi-objective Job-Shop Scheduling Problem Considering Job Transport","year":2020,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Science and Technology Commission of Shanghai Municipality; University of Shanghai for Science and Technology; National Natural Science Foundation of China","keywords":"Tardiness; Job shop scheduling; Mathematical optimization; Sorting; Computer science; Genetic algorithm; Ant colony optimization algorithms; Task (project management); Scheduling (production processes); Algorithm; Mathematics; Engineering; Schedule","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004619142,0.0004511926,0.0005787264,0.0002345196,0.0004568803,0.0003271081,0.0002960577,0.0001498884,0.0001165232],"category_scores_gemma":[0.0001885628,0.0004585613,0.0002617493,0.0005601571,0.00007581118,0.0006523546,0.00003280182,0.0005496134,0.00002750398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002266952,"about_ca_system_score_gemma":0.0001364574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008928777,"about_ca_topic_score_gemma":0.000005182854,"domain_scores_codex":[0.9975273,0.0001089139,0.000988013,0.0003865062,0.0003928578,0.000596388],"domain_scores_gemma":[0.9985675,0.0001198053,0.0002669962,0.0001806285,0.0004155529,0.0004495005],"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.00001198271,0.00002259203,0.000333435,0.0002513045,0.0002068269,0.00006947464,0.00228789,0.9508833,0.0003892905,0.0000698064,0.00003802261,0.04543613],"study_design_scores_gemma":[0.002335677,0.0001140702,0.001343725,0.0003068769,0.0001069719,0.0002540492,0.0007968057,0.9935341,0.0005549406,0.00004685025,0.00009000168,0.0005159469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009975358,0.0009326921,0.9857665,0.000121652,0.0005421602,0.0006531866,0.00006766096,0.001312444,0.000628315],"genre_scores_gemma":[0.04145564,0.0002225075,0.9572059,0.0001536406,0.0005024738,0.00005516788,0.00002351967,0.0002068004,0.0001743365],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04492018,"threshold_uncertainty_score":0.9997866,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03185894206130593,"score_gpt":0.2639041640433858,"score_spread":0.2320452219820799,"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."}}