Citations (28)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (10)
Christian Gahm, Stefan Wahl & Axel Tuma. (2022) Scheduling parallel serial-batch processing machines with incompatible job families, sequence-dependent setup times and arbitrary sizes. International Journal of Production Research 60:17, pages 5131-5154.
Read now
Read now
Zhen Chen, Xu Zheng, Shengchao Zhou, Chuang Liu & Huaping Chen. (2020) Quantum-inspired ant colony optimisation algorithm for a two-stage permutation flow shop with batch processing machines. International Journal of Production Research 58:19, pages 5945-5963.
Read now
Read now
Jing-jing Wang & Ling Wang. (2019) Decoding methods for the flow shop scheduling with peak power consumption constraints. International Journal of Production Research 57:10, pages 3200-3218.
Read now
Read now
Xu Zheng, Shengchao Zhou & Huaping Chen. (2019) Ant colony optimisation algorithms for two-stage permutation flow shop with batch processing machines and nonidentical job sizes. International Journal of Production Research 57:10, pages 3060-3079.
Read now
Read now
Gudar J. Ibrahim, Tarik A. Rashid & Ahmed T. Sadiq. (2018) Evolutionary DNA Computing Algorithm for Job Scheduling Problem. IETE Journal of Research 64:4, pages 514-527.
Read now
Read now
Kamran Shahnaghi, Hani Shahmoradi-Moghadam, Amir Noroozi & Hadi Mokhtari. (2016) A robust modelling and optimisation framework for a batch processing flow shop production system in the presence of uncertainties. International Journal of Computer Integrated Manufacturing 29:1, pages 92-106.
Read now
Read now
R. M’Hallah. (2014) An iterated local search variable neighborhood descent hybrid heuristic for the total earliness tardiness permutation flow shop. International Journal of Production Research 52:13, pages 3802-3819.
Read now
Read now
Deming Lei & Xiuping Guo. (2014) Variable neighbourhood search for dual-resource constrained flexible job shop scheduling. International Journal of Production Research 52:9, pages 2519-2529.
Read now
Read now
Xiaoge Zhang, Yong Deng, Felix
T.S. Chan, Peida Xu, Sankaran Mahadevan & Yong Hu. (2013) IFSJSP: A novel methodology for the Job-Shop Scheduling Problem based on intuitionistic fuzzy sets. International Journal of Production Research 51:17, pages 5100-5119.
Read now
Read now
Jian Gao, Rong Chen & Wu Deng. (2013) An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem. International Journal of Production Research 51:3, pages 641-651.
Read now
Read now
Articles from other publishers (18)
Pedram Beldar, Milad Moghtader, Adriana Giret & Amir Hossein Ansaripoor. (2022) Non-identical parallel machines batch processing problem with release dates, due dates and variable maintenance activity to minimize total tardiness. Computers & Industrial Engineering 168, pages 108135.
Crossref
Crossref
John W. Fowler & Lars Mönch. (2022) A survey of scheduling with parallel batch (p-batch) processing. European Journal of Operational Research 298:1, pages 1-24.
Crossref
Crossref
Xiaoyuan Lian, Zhong Zheng, Cheng Wang & Xiaoqiang Gao. (2021) An energy-efficient hybrid flow shop scheduling problem in steelmaking plants. Computers & Industrial Engineering 162, pages 107683.
Crossref
Crossref
Shijin Wang, Ruochen Wu, Feng Chu & Jianbo Yu. (2019) Variable neighborhood search-based methods for integrated hybrid flow shop scheduling with distribution. Soft Computing 24:12, pages 8917-8936.
Crossref
Crossref
Fuqing Zhao, Shuo Qin, Yi Zhang, Weimin Ma, Chuck Zhang & Houbin Song. (2019) A hybrid biogeography-based optimization with variable neighborhood search mechanism for no-wait flow shop scheduling problem. Expert Systems with Applications 126, pages 321-339.
Crossref
Crossref
Arindam Majumder, Dipak Laha & P.N. Suganthan. (2018) A hybrid cuckoo search algorithm in parallel batch processing machines with unequal job ready times. Computers & Industrial Engineering 124, pages 65-76.
Crossref
Crossref
Hadi Mokhtari & Amir Noroozi. (2015) An efficient chaotic based PSO for earliness/tardiness optimization in a batch processing flow shop scheduling problem. Journal of Intelligent Manufacturing 29:5, pages 1063-1081.
Crossref
Crossref
Yi Tan, Lars Mönch & John W. Fowler. (2017) A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines. Journal of Scheduling 21:2, pages 209-226.
Crossref
Crossref
Arindam Majumder & Dipak Laha. 2018. Progress in Advanced Computing and Intelligent Engineering. Progress in Advanced Computing and Intelligent Engineering
645
653
.
Deming Lei. (2015) Two-phase neighborhood search algorithm for two-agent hybrid flow shop scheduling problem. Applied Soft Computing 34, pages 721-727.
Crossref
Crossref
Deming Lei. (2015) Variable neighborhood search for two-agent flow shop scheduling problem. Computers & Industrial Engineering 80, pages 125-131.
Crossref
Crossref
Yi Tan, Lars Monch & John W. Fowler. (2014) Decomposition heuristic for a two-machine flow shop with batch processing. Decomposition heuristic for a two-machine flow shop with batch processing.
Andrew Bilyk, Lars Mönch & Christian Almeder. (2014) Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristics. Computers & Industrial Engineering 78, pages 175-185.
Crossref
Crossref
Farhad Ghassemi Tari & Laya Olfat. (2013) Heuristic rules for tardiness problem in flow shop with intermediate due dates. The International Journal of Advanced Manufacturing Technology 71:1-4, pages 381-393.
Crossref
Crossref
Alessandro Condotta, Sigrid Knust, Dimitri Meier & Natalia V. Shakhlevich. (2013) Tabu search and lower bounds for a combined production–transportation problem. Computers & Operations Research 40:3, pages 886-900.
Crossref
Crossref
Amir Noroozi, Hadi Mokhtari & Isa Nakhai Kamal Abadi. (2013) Research on computational intelligence algorithms with adaptive learning approach for scheduling problems with batch processing machines. Neurocomputing 101, pages 190-203.
Crossref
Crossref
Marc-Andrè Isenberg & Bernd Scholz-Reiter. 2013. Dynamics in Logistics. Dynamics in Logistics
113
124
.
Deming Lei & Tao Wang. (2011) An effective neighborhood search algorithm for scheduling a flow shop of batch processing machines. Computers & Industrial Engineering 61:3, pages 739-743.
Crossref
Crossref