{"id":"W2338430224","doi":"10.1080/03155986.2016.1166795","title":"Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints","year":2016,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Mathematical optimization; Minification; Computer science; Computation; Integer programming; Scheduling (production processes); Heuristic; Linear programming; Single-machine scheduling; Mathematics; Algorithm; Schedule","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":true,"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.001241279,0.001183124,0.001169084,0.0006101441,0.0006832334,0.0008963314,0.0009383672,0.0006506835,0.001112222],"category_scores_gemma":[0.001584383,0.000484173,0.0009089781,0.0007563395,0.0004774232,0.000649342,0.0005875704,0.0006699686,0.0001186192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008148525,"about_ca_system_score_gemma":0.001371847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003212846,"about_ca_topic_score_gemma":0.002970263,"domain_scores_codex":[0.9993777,0.0002512775,0.00002394091,0.00009886824,0.0001286796,0.0001194622],"domain_scores_gemma":[0.9991257,0.0005350257,0.0001656309,0.00003375901,0.0000646554,0.00007516405],"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.0002276401,0.00009504049,0.0003075989,0.0003389832,0.00005579358,0.000214745,0.00005165493,0.9725686,0.006232388,0.003355433,0.0005932131,0.01595892],"study_design_scores_gemma":[0.00001277261,0.0001708179,0.0005107793,0.00001058223,0.00001774445,0.00004329684,0.00002980963,0.9946853,0.001576998,0.002515151,0.000419829,0.000006978626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2716957,0.001794689,0.7152688,0.0003130712,0.0001615706,0.0003792835,0.0002883628,0.0003467044,0.009751817],"genre_scores_gemma":[0.9204186,0.0005641118,0.07565346,0.00003783244,0.00007408886,0.0002321717,0.0001885121,0.000101534,0.002729664],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003212846,"threshold_uncertainty_score":0.006564617,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03015870374752165,"score_gpt":0.2840573161787088,"score_spread":0.2538986124311872,"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."}}