A Novel Arc-Flow-Graph-Based Modeling and Optimization Method for Parallel-Machine Parallel-Batch Scheduling Problems with Non-Identical Release Time and Product Specifications
暂无分享,去创建一个
[1] Ying Tang,et al. Stochastic Hybrid Discrete Grey Wolf Optimizer for Multi-Objective Disassembly Sequencing and Line Balancing Planning in Disassembling Multiple Products , 2022, IEEE Transactions on Automation Science and Engineering.
[2] MengChu Zhou,et al. Iterated Greedy Algorithms for Flow-Shop Scheduling Problems: A Tutorial , 2022, IEEE Transactions on Automation Science and Engineering.
[3] Ziyan Zhao,et al. Heuristic Scheduling of Batch Production Processes Based on Petri Nets and Iterated Greedy Algorithms , 2022, IEEE Transactions on Automation Science and Engineering.
[4] John W. Fowler,et al. A survey of scheduling with parallel batch (p-batch) processing , 2021, Eur. J. Oper. Res..
[5] MengChu Zhou,et al. Dual-Objective Mixed Integer Linear Program and Memetic Algorithm for an Industrial Group Scheduling Problem , 2021, IEEE/CAA Journal of Automatica Sinica.
[6] Renan Spencer Trindade,et al. Arc-flow approach for single batch-processing machine scheduling , 2020, Comput. Oper. Res..
[7] MengChu Zhou,et al. Decomposition Method for New Single-Machine Scheduling Problems From Steel Production Systems , 2020, IEEE Transactions on Automation Science and Engineering.
[8] M. Iori,et al. Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time , 2020, Comput. Oper. Res..
[9] Marcia Fampa,et al. Arc-Flow Approach for Parallel Batch Processing Machine Scheduling with Non-identical Job Sizes , 2020, ISCO.
[10] Arthur Kramer,et al. Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines , 2018, Eur. J. Oper. Res..
[11] Felipe Martins Müller,et al. Modelling and symmetry breaking in scheduling problems on batch processing machines , 2018, Int. J. Prod. Res..
[12] Mehdi Mrad,et al. An Arc-Flow Model for the Makespan Minimization Problem on Identical Parallel Machines , 2018, IEEE Access.
[13] Huaping Chen,et al. Distance matrix based heuristics to minimize makespan of parallel batch processing machines with arbitrary job sizes and release times , 2017, Appl. Soft Comput..
[14] Manuel Iori,et al. Bin packing and cutting stock problems: Mathematical models and exact algorithms , 2016, Eur. J. Oper. Res..
[15] João Pedro Pedroso,et al. Bin packing and related problems: General arc-flow formulation with graph compression , 2013, Comput. Oper. Res..
[16] Wen Lea Pearn,et al. Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes , 2009 .
[17] James C. Bean,et al. A Genetic Algorithm for Scheduling Parallel Non-identical Batch Processing Machines , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.
[18] Sharif H. Melouk,et al. Minimizing makespan on parallel batch processing machines , 2004 .
[19] Purushothaman Damodaran,et al. Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing , 2004 .
[20] José M. Valério de Carvalho,et al. Exact solution of bin-packing problems using column generation and branch-and-bound , 1999, Ann. Oper. Res..
[21] R. Uzsoy. Scheduling a single batch processing machine with non-identical job sizes , 1994 .
[22] Reha Uzsoy,et al. Efficient Algorithms for Scheduling Semiconductor Burn-In Operations , 1992, Oper. Res..