{"id":"W2086111473","doi":"10.1016/j.cor.2004.01.001","title":"Parallel machine selection and job scheduling to minimize machine cost and job tardiness","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":82,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tardiness; Computer science; Tabu search; Mathematical optimization; Job shop scheduling; Scheduling (production processes); Selection (genetic algorithm); Due date; Heuristic; Algorithm; Schedule; Artificial intelligence; Mathematics","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.0004528771,0.0001617401,0.0001795215,0.0003902176,0.000515301,0.0004078597,0.0001417835,0.00008148848,0.00002281353],"category_scores_gemma":[0.00009823641,0.0001641601,0.0000224464,0.0006967742,0.00005766083,0.0002063689,0.0001111383,0.0003847428,0.00003106741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001157501,"about_ca_system_score_gemma":0.00005604525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002501099,"about_ca_topic_score_gemma":0.0002738593,"domain_scores_codex":[0.9987723,0.00007247026,0.0002224982,0.0003135848,0.0002704589,0.0003486938],"domain_scores_gemma":[0.9992415,0.00008318367,0.000005974507,0.0001717047,0.0002418155,0.000255832],"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.00001238809,0.00001734325,0.000566305,0.00002181925,0.00002626823,0.000003830427,0.0004332156,0.9921819,0.0004987041,0.0005066359,0.00008533274,0.00564629],"study_design_scores_gemma":[0.0009508327,0.00005151242,0.002305488,0.00004860081,0.000006064849,0.00003596774,0.00007211778,0.9956868,0.000341967,0.0000409051,0.0002747668,0.0001849733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1520699,0.0007387109,0.8446209,0.001554993,0.0002122264,0.0004373789,0.00001166182,0.0001925205,0.0001616433],"genre_scores_gemma":[0.4556533,0.000264016,0.5435559,0.00008891943,0.0001517598,0.00007502662,0.00003447934,0.00003526841,0.0001413979],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3035833,"threshold_uncertainty_score":0.6694255,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03315502815199124,"score_gpt":0.3158891169154314,"score_spread":0.2827340887634402,"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."}}