{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001248064,0.001099929,0.001780271,0.0007539043,0.0006758277,0.0009091846,0.002081859,0.001578104,0.006978716],"category_scores_gemma":[0.002033862,0.0009025137,0.0009956254,0.001046626,0.0006247927,0.001391972,0.001706074,0.001270222,0.0004293539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007404623,"about_ca_system_score_gemma":0.002262198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005406995,"about_ca_topic_score_gemma":0.005341958,"domain_scores_codex":[0.9993748,0.0001910179,0.00002641602,0.00011572,0.0001724178,0.0001196213],"domain_scores_gemma":[0.9993502,0.0003955862,0.00005909191,0.00003769852,0.00009763072,0.00005970329],"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.0002521854,0.0001496569,0.0002257938,0.0001599446,0.0000532873,0.00008924505,0.00007179883,0.9411194,0.00211406,0.01529509,0.001567708,0.03890184],"study_design_scores_gemma":[0.00004669359,0.00006038071,0.00004651204,0.000003345865,0.000008426198,0.000009405635,0.00001073921,0.9955555,0.0002520726,0.003516826,0.0004844981,0.000005708768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01158673,0.0001279369,0.9846855,0.000135476,0.0000796278,0.0001280339,0.00005483621,0.0001481411,0.00305373],"genre_scores_gemma":[0.5034546,0.0002404243,0.4884541,0.0001673207,0.0001035391,0.0004473939,0.0002185614,0.0001235702,0.006790497],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006978716,"threshold_uncertainty_score":0.02334613,"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."}}