{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002699023,0.002294088,0.00197224,0.0011697,0.0009774361,0.003694118,0.00166511,0.004251152,0.03858785],"category_scores_gemma":[0.01315956,0.001153853,0.001710471,0.001055909,0.001182019,0.002042312,0.001701834,0.003514602,0.007092035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002811292,"about_ca_system_score_gemma":0.006613889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01735222,"about_ca_topic_score_gemma":0.02614048,"domain_scores_codex":[0.9988986,0.0002744531,0.00006183072,0.0003062129,0.0002579033,0.0002009937],"domain_scores_gemma":[0.9945458,0.003885113,0.0002286398,0.0001252188,0.001065806,0.0001494354],"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.0001652997,0.000138367,0.001053893,0.000816559,0.00005114495,0.0002693532,0.0002337554,0.9004781,0.001722992,0.02585266,0.02144273,0.04777516],"study_design_scores_gemma":[0.00007731608,0.00007956295,0.0005629595,0.0002315949,0.00004003103,0.0001238032,0.0003037744,0.9682585,0.0009525185,0.02102084,0.008308898,0.00004025771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01044451,0.001835414,0.9525316,0.00240173,0.000487169,0.0003850247,0.00146846,0.0008372957,0.02960868],"genre_scores_gemma":[0.2566462,0.002417826,0.6852346,0.00104961,0.0003092928,0.002056374,0.002824959,0.0007361424,0.04872493],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03858785,"threshold_uncertainty_score":0.1290892,"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."}}