{"id":"W1596352210","doi":"10.1016/j.dam.2011.04.003","title":"A closed-form solution for the optimal release times for the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>F</mml:mi><mml:mn>2</mml:mn><mml:mo>|</mml:mo></mml:math> deteriorating jobs <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mo>|</mml:mo><mml:mo>∑</mml:mo><mml:msub><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math> problem","year":2011,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Hong Kong Polytechnic University","keywords":"Monotone polygon; Job shop scheduling; Scheduling (production processes); Mathematics; Mathematical optimization; Algorithm; Computer science; Routing (electronic design automation); Geometry","routes":{"ca_aff":true,"ca_fund":false,"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","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.007146333,0.003548058,0.001330631,0.001800472,0.006815064,0.005827257,0.007734163,0.007815694,0.3642474],"category_scores_gemma":[0.005682029,0.006522737,0.006736561,0.003855584,0.005093101,0.004462902,0.006158912,0.005853463,0.004811897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009107416,"about_ca_system_score_gemma":0.004605797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00353408,"about_ca_topic_score_gemma":0.003197227,"domain_scores_codex":[0.9709564,0.001064246,0.006902483,0.005549848,0.00736679,0.008160247],"domain_scores_gemma":[0.9744956,0.00651992,0.007662839,0.006879881,0.0008088195,0.003632949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.005301436,0.001110875,0.00001338845,0.005370285,0.006405344,0.001747486,0.007009334,0.0194711,0.004665432,0.6267586,0.3171903,0.004956391],"study_design_scores_gemma":[0.005280485,0.003287887,0.00004121902,0.003287385,0.005895326,0.002867085,0.006306871,0.2814702,0.6818323,0.001111737,0.003843359,0.004776121],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4445972,0.004464802,0.02229815,0.001729295,0.008364273,0.0004211998,0.002603625,0.001678156,0.5138433],"genre_scores_gemma":[0.9330426,0.003835312,0.03359145,0.003051076,0.006370661,0.009913153,0.005349915,0.004240326,0.0006054683],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6771669,"threshold_uncertainty_score":0.9977242,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01935625462398985,"score_gpt":0.2366380596999281,"score_spread":0.2172818050759382,"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."}}