{"id":"W3163438333","doi":"10.5267/j.dsl.2021.4.002","title":"A single machine multi-job integer batch scheduling problem with multi due date to minimize total actual flow time","year":2021,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Flow shop scheduling; Computer science; Mathematical optimization; Job scheduler; Scheduling (production processes); Job shop scheduling; Maximum flow problem; Algorithm; Permutation (music); Single-machine scheduling; Mathematics; 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":[],"consensus_categories":[],"category_scores_codex":[0.0005442657,0.000272877,0.0002847404,0.0003306841,0.0002251481,0.0004402905,0.0004663278,0.00006884382,0.0001880502],"category_scores_gemma":[0.0004765778,0.0002293585,0.00006384928,0.00176607,0.0001458905,0.0005272237,0.0001767944,0.0002716953,0.0004009355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001079806,"about_ca_system_score_gemma":0.0000767249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007957393,"about_ca_topic_score_gemma":0.000008994458,"domain_scores_codex":[0.9976171,0.00002953641,0.0003709312,0.0006733317,0.0007595972,0.0005494904],"domain_scores_gemma":[0.9987286,0.0001879248,0.00004440285,0.0004983484,0.0002112202,0.0003294881],"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.00002202797,0.00004674602,0.0001167562,0.000004762094,0.00001138674,0.00008180541,0.0007758199,0.8197208,0.1609784,0.000001032988,0.0001370039,0.01810345],"study_design_scores_gemma":[0.0009198387,0.00002687489,0.0006021932,0.0001229466,0.000009734273,0.0001040104,0.0002056702,0.96943,0.028065,0.000001083516,0.0001617376,0.0003509243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3568636,0.00002883254,0.6415915,0.0008005367,0.0003310276,0.0001264403,0.0000118512,0.0001909792,0.00005520044],"genre_scores_gemma":[0.1188655,0.000001990348,0.8794572,0.001407707,0.00006008298,0.00001564627,0.00001341789,0.00004346089,0.0001349587],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2379981,"threshold_uncertainty_score":0.9352968,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01693854806218633,"score_gpt":0.2465896657828393,"score_spread":0.2296511177206529,"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."}}