{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001062172,0.001079528,0.001321818,0.0006543018,0.000731086,0.0007350168,0.001628126,0.00166221,0.002477047],"category_scores_gemma":[0.001228429,0.0006174751,0.0009833022,0.0006747799,0.0004054962,0.0008917404,0.0009750847,0.0009884932,0.0003561581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006354892,"about_ca_system_score_gemma":0.002315578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004573397,"about_ca_topic_score_gemma":0.004648676,"domain_scores_codex":[0.9994473,0.0001711672,0.00003305891,0.0001141723,0.0001565816,0.00007780688],"domain_scores_gemma":[0.999606,0.0001931482,0.00004315188,0.00002341981,0.00009828627,0.00003602481],"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.0001068171,0.0001342773,0.0004294112,0.0001693713,0.00004363276,0.00009088949,0.00006855264,0.9246894,0.003503419,0.004562912,0.0009711707,0.06523012],"study_design_scores_gemma":[0.00003764563,0.00008241278,0.00009080877,0.000005277922,0.000008742447,0.00001920249,0.000007209552,0.9980064,0.0004647383,0.0007255984,0.0005459972,0.000006013325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01505148,0.0001950879,0.9815129,0.0001119282,0.00005471774,0.0001898349,0.00003426775,0.0003319329,0.002517868],"genre_scores_gemma":[0.3622137,0.0002612458,0.6313981,0.0001309676,0.0000601507,0.000815107,0.0001711927,0.00009082944,0.004858693],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004573397,"threshold_uncertainty_score":0.009093583,"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."}}