{"id":"W2126394800","doi":"10.1007/s10951-006-7041-z","title":"On the connection between a cyclic job shop and a reentrant flow shop scheduling problem","year":2006,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Canadian Imperial Bank of Commerce (Canada); McMaster University","funders":"","keywords":"Reentrancy; Flow shop scheduling; Job shop; Job shop scheduling; Computer science; Flow (mathematics); Mathematical optimization; Scheduling (production processes); Mathematics; Schedule; Operating system","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.002115318,0.000507562,0.000833164,0.001386794,0.001326281,0.001501603,0.002072215,0.002143371,0.006567198],"category_scores_gemma":[0.01450354,0.0005342932,0.0009533187,0.002342083,0.002341273,0.005273574,0.001807898,0.002578752,0.0003454926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007893498,"about_ca_system_score_gemma":0.0008883292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002401557,"about_ca_topic_score_gemma":0.002160581,"domain_scores_codex":[0.9991717,0.0003721266,0.00004765288,0.0001659408,0.000153091,0.00008953671],"domain_scores_gemma":[0.9887387,0.009329434,0.000787845,0.0003114729,0.0004851629,0.0003475185],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003323415,0.0001525105,0.001446653,0.0002868739,0.00004697531,0.0009770278,0.0005271861,0.1058248,0.001230296,0.8582834,0.004945562,0.02594644],"study_design_scores_gemma":[0.00004668244,0.00009000713,0.0007354991,0.00004385803,0.00002553443,0.0002208602,0.0001021392,0.3801389,0.0001838916,0.614469,0.003911947,0.0000316628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2586614,0.003095989,0.6771671,0.005653136,0.0006609999,0.0001719265,0.0004000927,0.0001565005,0.05403282],"genre_scores_gemma":[0.8384393,0.003317613,0.1429393,0.0008238314,0.001188417,0.0001555349,0.000511909,0.0001328502,0.01249111],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006567198,"threshold_uncertainty_score":0.0219695,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01274153345171136,"score_gpt":0.2172254222996539,"score_spread":0.2044838888479425,"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."}}