{"id":"W2052949763","doi":"10.3182/20060517-3-fr-2903.00029","title":"USING JOHNSON'S ALGORITHM TO APPROXIMATE SOME FLOW SHOP SCHEDULING PROBLEMS WITH UNAVAILABILITY PERIODS","year":2006,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Unavailability; Job shop scheduling; Flow shop scheduling; Mathematical optimization; Scheduling (production processes); Computer science; Focus (optics); Heuristic; Flow (mathematics); Algorithm; Time complexity; Mathematics","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"],"consensus_categories":[],"category_scores_codex":[0.0003397663,0.0004561963,0.0004269068,0.0002602422,0.0002757647,0.0004340612,0.0002818478,0.0001860814,0.00005515234],"category_scores_gemma":[0.00004691037,0.0004376656,0.00008521439,0.0008303326,0.00009405962,0.0007368387,0.00007112591,0.0003275936,0.00004616476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002404235,"about_ca_system_score_gemma":0.00005650448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000635196,"about_ca_topic_score_gemma":0.000006276314,"domain_scores_codex":[0.9977358,0.000007463277,0.0004580899,0.000608286,0.0004518881,0.0007384762],"domain_scores_gemma":[0.9991184,0.00001789044,0.00008298812,0.0002054635,0.0003462393,0.0002289537],"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.00001453894,0.00007306338,0.003806304,0.0003031425,0.00005632425,0.000004116501,0.0006344903,0.9814469,0.002526789,0.0001494449,0.000243872,0.01074099],"study_design_scores_gemma":[0.0004754297,0.00006586992,0.0002820012,0.000163473,0.0000415195,0.00003310118,0.0002969707,0.9926406,0.004177054,0.0002251135,0.0009633516,0.0006354987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5500672,0.000829604,0.4439349,0.0001541977,0.0004334506,0.0008304639,0.00003208413,0.002136257,0.001581833],"genre_scores_gemma":[0.1324858,0.00002555623,0.8664372,0.00005351462,0.0005045291,0.00009150554,0.00001878851,0.0001411067,0.0002420216],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4225023,"threshold_uncertainty_score":0.9998075,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01298295494278786,"score_gpt":0.2197555599991924,"score_spread":0.2067726050564046,"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."}}