{"id":"W2016668986","doi":"10.5555/338219.338653","title":"New and improved algorithms for minsum shop scheduling","year":2000,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Job shop scheduling; Multiprocessor scheduling; Open shop; Linear programming relaxation; Approximation algorithm; Flow shop scheduling; Mathematical optimization; Scheduling (production processes); Multiprocessing; Schedule; Computer science; Relaxation (psychology); Greedy algorithm; Mathematics; Algorithm; Linear programming; Parallel computing","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.002624158,0.00148726,0.001235736,0.001440116,0.0008026605,0.001751236,0.003047838,0.001427764,0.008179685],"category_scores_gemma":[0.006107355,0.000799813,0.001700367,0.001936119,0.0008828267,0.004152107,0.002590017,0.003111221,0.003028624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001390057,"about_ca_system_score_gemma":0.00166402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001972124,"about_ca_topic_score_gemma":0.002913518,"domain_scores_codex":[0.9980578,0.0005051313,0.0001286468,0.0003165939,0.0007605522,0.0002313831],"domain_scores_gemma":[0.9982067,0.0007625276,0.0001310522,0.0004825424,0.0003181465,0.0000989399],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002970195,0.0003212336,0.0005503008,0.0003623948,0.0001194588,0.0001168215,0.0002004465,0.4004202,0.00505465,0.1579657,0.01225733,0.4223345],"study_design_scores_gemma":[0.00005747417,0.00005542122,0.00008963279,0.00002359448,0.000020176,0.00007375601,0.00001940255,0.9198356,0.001646029,0.06534739,0.01281568,0.00001585156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002552875,0.0005210222,0.9926044,0.000156177,0.0001509074,0.00005357737,0.00006134369,0.0007585768,0.003141102],"genre_scores_gemma":[0.0534781,0.0006959009,0.939195,0.000239394,0.0002438917,0.0001935503,0.0003730363,0.0003361132,0.005244994],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008179685,"threshold_uncertainty_score":0.02736378,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01292954355004171,"score_gpt":0.2324777606685095,"score_spread":0.2195482171184678,"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."}}