{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002911839,0.001301319,0.001594526,0.001671367,0.001387108,0.001981199,0.002056213,0.001621933,0.003066721],"category_scores_gemma":[0.009127707,0.001102975,0.001313869,0.002529056,0.001168568,0.0032283,0.0009621094,0.001471145,0.0004385687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002338878,"about_ca_system_score_gemma":0.002735499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0135342,"about_ca_topic_score_gemma":0.02266437,"domain_scores_codex":[0.9986558,0.0004720485,0.00008060779,0.0001787557,0.0004097788,0.0002030736],"domain_scores_gemma":[0.9964574,0.002397116,0.0002286079,0.000329605,0.000463746,0.0001234165],"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.000240209,0.0001853281,0.000611213,0.00009527364,0.00005681995,0.00005477856,0.00007587059,0.9149858,0.00114894,0.02120881,0.001768946,0.05956797],"study_design_scores_gemma":[0.0000120485,0.00002259958,0.00005443644,0.0000040806,0.00001001623,0.000009911949,0.00001007711,0.9941853,0.0002955863,0.004994359,0.0003961098,0.000005488781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04468185,0.0007228057,0.9487653,0.0002653531,0.0001567853,0.00006519772,0.00009094387,0.0009358422,0.004315879],"genre_scores_gemma":[0.3296653,0.0004493426,0.6660056,0.0001527452,0.0001127196,0.00016852,0.0002423095,0.0002351784,0.002968386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0135342,"threshold_uncertainty_score":0.02691084,"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."}}