{"id":"W1983793065","doi":"10.1080/00207543.2011.648277","title":"A meta-heuristic approach for solving the no-wait flow-shop problem","year":2012,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Flow shop scheduling; Job shop scheduling; Tabu search; Computer science; Tardiness; Particle swarm optimization; Mathematics; Algorithm; Schedule","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.00386756,0.00009472732,0.000149,0.0003025929,0.000132866,0.0001268503,0.0004281681,0.00004630023,0.0001204413],"category_scores_gemma":[0.0009934221,0.00006284783,0.0001494476,0.0002292331,0.00005968878,0.0003689152,0.00004026035,0.0004659758,0.00002559157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001285104,"about_ca_system_score_gemma":0.00005286936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002417011,"about_ca_topic_score_gemma":2.698304e-7,"domain_scores_codex":[0.9982483,0.00008310959,0.0003781472,0.0001060515,0.000909717,0.0002747239],"domain_scores_gemma":[0.9970679,0.0002007588,0.00009013899,0.0001364158,0.002416754,0.00008809243],"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.000142628,0.0002752588,0.0002141909,0.0001009456,0.003244246,0.000002580773,0.001647647,0.9451175,0.002273199,0.001340706,0.03507949,0.01056164],"study_design_scores_gemma":[0.0008160619,0.0001208116,0.0001541171,0.0000565188,0.0003491555,0.0004714574,0.0009437521,0.9424521,0.007277658,0.001087799,0.04599921,0.000271294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006550964,0.005180763,0.9648532,0.006358331,0.01043827,0.0009436224,0.00002096493,0.0001309059,0.005523008],"genre_scores_gemma":[0.4774557,0.0003435319,0.509697,0.00004692495,0.009707191,0.0001425296,0.00001823433,0.00005829525,0.002530616],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4709048,"threshold_uncertainty_score":0.256286,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1491187437332926,"score_gpt":0.3637089456872152,"score_spread":0.2145902019539226,"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."}}