{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001092609,0.0001305851,0.0001981972,0.000240647,0.0002396732,0.0002132132,0.00008288011,0.0001039916,0.0000277558],"category_scores_gemma":[0.0004222122,0.00009071816,0.00002016439,0.0001947753,0.0001866088,0.001249484,0.00002880788,0.00010021,0.00001112907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005867876,"about_ca_system_score_gemma":0.0001247562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000893403,"about_ca_topic_score_gemma":0.0000213959,"domain_scores_codex":[0.9986004,0.00003222977,0.0005611307,0.0001238051,0.0004369393,0.0002455198],"domain_scores_gemma":[0.9982356,0.0004516581,0.00007838822,0.000149064,0.0009702907,0.0001149867],"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.0003977963,0.0000282584,0.02964487,0.001221217,0.0001207401,3.932557e-7,0.00156852,0.9455488,0.0009766032,0.007458893,0.0006258449,0.01240801],"study_design_scores_gemma":[0.002345539,0.00009422296,0.002849492,0.0002031588,0.000004940049,0.000009346686,0.0006056335,0.9902043,0.0006729809,0.00001991163,0.002841367,0.0001490872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2062189,0.0002895316,0.7881398,0.0002295979,0.0001774655,0.001836443,0.0004970061,0.00009874407,0.002512511],"genre_scores_gemma":[0.9650595,0.0001160344,0.03410508,0.00001735491,0.00004292861,0.000204417,0.0001424861,0.0000132576,0.0002989876],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7588405,"threshold_uncertainty_score":0.3699379,"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."}}