{"id":"W2005299742","doi":"10.1007/s10479-012-1059-8","title":"Makespan minimization for parallel machines scheduling with multiple availability constraints","year":2012,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Lexicographical order; Theory of computation; Mathematical optimization; Enumeration; Computer science; Minification; Integer programming; Scheduling (production processes); Branch and bound; Linear programming; Algorithm; Mathematics; Schedule; Discrete 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002083112,0.001630118,0.001958287,0.001224901,0.0009336184,0.001327988,0.001615946,0.0009430943,0.00206047],"category_scores_gemma":[0.003448293,0.001163639,0.001152408,0.001750138,0.0006405679,0.001414759,0.001098471,0.001393299,0.0002093319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001395117,"about_ca_system_score_gemma":0.001644035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004998889,"about_ca_topic_score_gemma":0.005106115,"domain_scores_codex":[0.9989365,0.0003989666,0.00004808524,0.000153397,0.0002506497,0.0002123949],"domain_scores_gemma":[0.9984733,0.001035142,0.0001788332,0.00006842193,0.0001359808,0.0001083704],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001637002,0.00006241188,0.0002167664,0.0001611998,0.00008556268,0.00007381686,0.00003718955,0.9768707,0.001619242,0.004853002,0.0009392156,0.01491727],"study_design_scores_gemma":[0.000011849,0.00005196334,0.0001983852,0.000008032355,0.00001634792,0.00001774447,0.00001229144,0.9915587,0.0004794596,0.007352338,0.0002870672,0.00000585041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09970784,0.001750394,0.8889967,0.0006860136,0.0002630257,0.0002117138,0.0003516925,0.0003517178,0.00768081],"genre_scores_gemma":[0.8277391,0.001044847,0.164842,0.000142868,0.000288755,0.0003117785,0.0003523456,0.0003149802,0.004963405],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004998889,"threshold_uncertainty_score":0.01101667,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1400472742882713,"score_gpt":0.3886945503331083,"score_spread":0.2486472760448371,"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."}}