Effective heuristic for makespan minimization in parallel batch machines with non-identical capacities-Reference-Cited by-同舟云学术

Effective heuristic for makespan minimization in parallel batch machines with non-identical capacities

Published:2015-11 Issue: Volume:169 Page:1-10
ISSN:0925-5273
Container-title:International Journal of Production Economics
language:en
Short-container-title:International Journal of Production Economics

Author:

Jia Zhao-hong,Li Kai,Leung Joseph Y.-T.

Funder

National Natural Science Foundation of China

Publisher

Elsevier BV

Subject

Industrial and Manufacturing Engineering,Management Science and Operations Research,Economics and Econometrics,General Business, Management and Accounting

Reference51 articles.

1. Metaheuristics for scheduling jobs with incompatible families on parallel batch machines;Almeder;J. Oper. Res. Soc.,2011

2. Scheduling a batching machine;Brucker;J. Sched.,1998

3. Minimizing makespan on parallel batch processing machines;Chang;Int. J. Prod. Res.,2004

4. Metaheuristics to minimize makespan on parallel batch processing machines with dynamic job arrivals;Chen;Int. J. Comput. Integr. Manuf.,2010

5. Scheduling a batch processing machine with nonidentical job sizes;Chen;Int. J. Prod. Res.,2011

Cited by 44 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Non-identical parallel machines batch processing problem to minimize the makespan: Models and algorithms;Computers & Operations Research;2024-08

2. An adaptive artificial bee colony for hybrid flow shop scheduling with batch processing machines in casting process;International Journal of Production Research;2023-11-09

3. Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization;European Journal of Operational Research;2023-09

4. A hybrid discrete differential evolution – genetic algorithm approach with a new batch formation mechanism for parallel batch scheduling considering batch delivery;International Journal of Production Research;2023-07-13

5. A tabu-based adaptive large neighborhood search for scheduling unrelated parallel batch processing machines with non-identical job sizes and dynamic job arrivals;Flexible Services and Manufacturing Journal;2023-03-11