A tabu-based adaptive large neighborhood search for scheduling unrelated parallel batch processing machines with non-identical job sizes and dynamic job arrivals-Reference-Cited by-同舟云学术

A tabu-based adaptive large neighborhood search for scheduling unrelated parallel batch processing machines with non-identical job sizes and dynamic job arrivals

Published:2023-03-11 Issue: Volume: Page:
ISSN:1936-6582
Container-title:Flexible Services and Manufacturing Journal
language:en
Short-container-title:Flex Serv Manuf J

Author:

Xiao Xin,Ji Bin^ORCID,Yu Samson S.,Wu Guohua

Funder

National Natural Science Foundation of China

Natural Science Foundation of Hunan Province

Central South University

Publisher

Springer Science and Business Media LLC

Subject

Industrial and Manufacturing Engineering,Management Science and Operations Research

Link

https://link.springer.com/content/pdf/10.1007/s10696-023-09488-9.pdf

Reference38 articles.

1. Almeder C, Mönch L (2011) Metaheuristics for scheduling jobs with incompatible families on parallel batching machines. J Oper Res Soc 62(12):2083–2096. https://doi.org/10.1057/jors.2010.186

2. Arroyo JEC, Leung JYT (2017a) An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times. Comput Ind Eng 105:84–100. https://doi.org/10.1016/j.cie.2016.12.038

3. Arroyo JEC, Leung JYT (2017b) Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times. Comput Oper Res 78:117–128. https://doi.org/10.1016/j.cor.2016.08.015

4. Chang PY, Damodaran P, Melouk S (2004) Minimizing makespan on parallel batch processing machines. Int J Prod Res 42(19):4211–4220. https://doi.org/10.1080/00207540410001711863

5. Chen H, Du B, Huang GQ (2010) Metaheuristics to minimise makespan on parallel batch processing machines with dynamic job arrivals. Int J Comput Integr Manuf 23(10):942–956. https://doi.org/10.1080/0951192x.2010.495137

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

1. Matheuristic algorithm for dock planning problems considering tandem and parallel methods in the shipbuilding industry;Computers & Industrial Engineering;2024-10

2. An adaptive shuffled frog-leaping algorithm for parallel batch processing machines scheduling with machine eligibility in fabric dyeing process;International Journal of Production Research;2024-03-05

3. A Cooperated Imperialist Competitive Algorithm for Unrelated Parallel Batch Machine Scheduling Problem;Computers, Materials & Continua;2024