{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009680667,0.0001025341,0.000142963,0.0001828447,0.0002197488,0.00006208009,0.0001213174,0.00007226061,0.0001462805],"category_scores_gemma":[0.0006626957,0.00008986408,0.00003859316,0.0003651747,0.0001738883,0.0003045344,0.00001751468,0.0001536163,0.00001944868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001509945,"about_ca_system_score_gemma":0.00006082889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002251483,"about_ca_topic_score_gemma":0.0000439875,"domain_scores_codex":[0.998885,0.00007930259,0.0002560155,0.000137857,0.0002686563,0.0003731196],"domain_scores_gemma":[0.9985111,0.0002579851,0.00001305833,0.0002244409,0.0008668762,0.0001265748],"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.00003375371,0.0001038884,0.006517771,0.00006889377,0.00004200608,1.428534e-7,0.0005700619,0.9871081,0.0005594423,0.0009329978,0.0003032265,0.003759763],"study_design_scores_gemma":[0.0004323287,0.00006174268,0.001826638,0.00002826853,0.000004745739,0.000002286258,0.0003611738,0.9910266,0.005790422,0.00002143945,0.0003241559,0.0001202018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4351858,0.000608867,0.561008,0.0007676597,0.0001428215,0.0009010546,0.00009744685,0.0001448768,0.001143403],"genre_scores_gemma":[0.7202029,0.00006131093,0.2792717,0.00002067101,0.0000905943,0.0001158486,0.00008193262,0.00002139633,0.0001336979],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.285017,"threshold_uncertainty_score":0.3664551,"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."}}