{"id":"W2129544266","doi":"10.1007/s10845-015-1086-9","title":"A two-phase approach to solve the synchronized bin–forklift scheduling problem","year":2015,"lang":"en","type":"article","venue":"Journal of Intelligent Manufacturing","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; Université de Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Scheduling (production processes); Solver; Column generation; Mathematical optimization; Integer programming; Computer science; Linear programming; Job shop scheduling; Bin packing problem; Algorithm; Bin; Routing (electronic design automation); Mathematics; Embedded system","routes":{"ca_aff":true,"ca_fund":false,"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.000700516,0.0002711124,0.0003406667,0.0002552214,0.0001046474,0.0001378639,0.0004387255,0.00007297268,0.00001317047],"category_scores_gemma":[0.0001445963,0.0001876051,0.0001437461,0.0001329548,0.00003701344,0.0002483463,0.00007809974,0.0005467639,0.00003144639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002991026,"about_ca_system_score_gemma":0.00005473812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007701227,"about_ca_topic_score_gemma":0.000002055197,"domain_scores_codex":[0.9982946,0.00002777474,0.0007020757,0.000166525,0.0004171333,0.0003918708],"domain_scores_gemma":[0.9989208,0.00009899499,0.0002219274,0.0002705787,0.0001703939,0.0003173285],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007501282,0.00007237805,0.000002480316,0.00004862524,0.0000909823,0.00001309789,0.001062035,0.9872165,0.0001804966,0.0003556647,0.0004232642,0.01045949],"study_design_scores_gemma":[0.004122984,0.0005944018,0.00001716603,0.0004470292,0.0002382982,0.0005962036,0.00421164,0.406398,0.5495374,0.006799763,0.02594418,0.001092899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04401753,0.0005365363,0.9505665,0.0001169429,0.0006783061,0.0002906156,0.000002455703,0.0001153544,0.003675806],"genre_scores_gemma":[0.7784991,0.00009485499,0.2207796,0.00008415369,0.0004262126,0.00001070899,0.000003493993,0.00005072378,0.00005122594],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7344815,"threshold_uncertainty_score":0.7650315,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03343138142196288,"score_gpt":0.2797332754027325,"score_spread":0.2463018939807696,"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."}}