{"id":"W3127712221","doi":"10.1155/2021/6627081","title":"Two‐Agent Single Machine Order Acceptance Scheduling Problem to Maximize Net Revenue","year":2021,"lang":"en","type":"article","venue":"Complexity","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Computer science; Particle swarm optimization; Metaheuristic; Benchmark (surveying); Job shop scheduling; Scheduling (production processes); Heuristic; Integer programming; Mathematics; Schedule","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":[],"consensus_categories":[],"category_scores_codex":[0.0001285123,0.0001744271,0.0002204693,0.0000504509,0.0001107634,0.00009911734,0.0001849777,0.00005141058,0.0005815803],"category_scores_gemma":[0.0001115857,0.0002001623,0.00005310751,0.0005568003,0.00002795109,0.00008285708,0.0000958626,0.0001995921,0.0001783747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009169347,"about_ca_system_score_gemma":0.00003215867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002098258,"about_ca_topic_score_gemma":0.0001202458,"domain_scores_codex":[0.9989587,0.00004050815,0.0002513264,0.0002774359,0.0001702068,0.0003018339],"domain_scores_gemma":[0.9992556,0.00002911431,0.00002892946,0.0003660602,0.0001613261,0.0001589553],"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.00000943052,0.00008162762,0.0003131821,0.00006915762,0.00005003604,0.00002711161,0.0003544764,0.9841416,0.002794255,0.0007951487,0.001166201,0.01019771],"study_design_scores_gemma":[0.001124276,0.00003478613,0.00105612,0.0001448743,0.00002338003,0.00004424827,0.0001597133,0.9682991,0.009687539,0.002422124,0.01635851,0.0006453565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07834107,0.001945573,0.9078094,0.001137982,0.001277605,0.0003217634,0.0001197133,0.00079663,0.008250288],"genre_scores_gemma":[0.1777343,0.00002425348,0.8210187,0.0004370889,0.0002061786,0.00002079028,0.00007471219,0.00004794933,0.0004360247],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09939326,"threshold_uncertainty_score":0.8162381,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04472565511332127,"score_gpt":0.2655855424775029,"score_spread":0.2208598873641817,"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."}}