{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006060136,0.0001154207,0.0001115977,0.0000408528,0.00005183468,0.00006003299,0.00006081878,0.0000733359,0.0005958908],"category_scores_gemma":[0.00001226552,0.0001115533,0.00003396671,0.00009121461,0.000009296931,0.00009462712,0.000005601965,0.00006334,0.00002609264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001230572,"about_ca_system_score_gemma":0.00001332923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001237053,"about_ca_topic_score_gemma":0.000002917276,"domain_scores_codex":[0.9994635,0.000002822922,0.000140467,0.0001475976,0.00005119529,0.00019439],"domain_scores_gemma":[0.9997059,0.00003191433,0.000007180754,0.00010705,0.00002118134,0.0001267565],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001198382,0.000009729862,0.00003860029,0.00003300179,0.00004325999,6.630474e-7,0.0001914503,0.1472119,0.0006030562,0.0001825667,0.000880298,0.8507935],"study_design_scores_gemma":[0.0006213241,0.00002080851,0.00003130918,0.000007583462,0.0000110352,0.000004253652,0.00004685483,0.9924347,0.001848577,0.0001024246,0.004707754,0.0001633752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01680541,0.0005642669,0.9764727,0.0001805697,0.0002857108,0.0002146915,0.000005970192,0.0006540681,0.004816587],"genre_scores_gemma":[0.009440668,0.0001480505,0.9829738,0.00009583716,0.0002529769,0.0000154562,0.00001242902,0.00003770578,0.007023131],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8506302,"threshold_uncertainty_score":0.6524586,"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."}}