Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem

Abedinnia, 2016, New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem, Computers & Operations Research, 74, 165, 10.1016/j.cor.2016.04.007

Bai, 2022, Blocking flowshop scheduling problems with release dates, Swarm and Evolutionary Computation, 74, 101140, 10.1016/j.swevo.2022.101140

Balaprakash P., Birattari M., & Stützle T. (2007). Improvement strategies for the F-Race algorithm: Sampling design and iterative refinement. In Hybrid Metaheuristics: 4th International Workshop, HM 2007, Dortmund, Germany, October 8-9, 2007. Proceedings 4 (pp. 108-122). Springer Berlin Heidelberg.

Bezerra, 2020, Automatically designing state-of-the-art multi-and many-objective evolutionary algorithms, Evolutionary computation, 28, 195, 10.1162/evco_a_00263

Birattari M., Stützle T., Paquete L., & Varrentrapp K. (2002, July). A Racing Algorithm for Configuring Metaheuristics. In Gecco (Vol. 2, No. 2002).

Chen, 2021, Production scheduling for blocking flowshop in distributed environment using effective heuristics and iterated greedy algorithm, Robotics and Computer-Integrated Manufacturing, 71, 102155, 10.1016/j.rcim.2021.102155

Dong, 2008, An improved NEH-based heuristic for the permutation flowshop problem, Computers & Operations Research, 35, 3962, 10.1016/j.cor.2007.05.005

Engin, 2011, An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems, Applied Soft Computing, 11, 3056, 10.1016/j.asoc.2010.12.006

Framinan, 2003, An efficient constructive heuristic for flowtime minimisation in permutation flow shops, Omega, 31, 311, 10.1016/S0305-0483(03)00047-1

Framinan, 2003, Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem, International Journal of Production Research, 41, 121, 10.1080/00207540210161650

Framinan, 2004, A review and classification of heuristics for permutation flow-shop scheduling with makespan objective, Journal of the Operational Research Society, 55, 1243, 10.1057/palgrave.jors.2601784

Gupta, 1971, A functional heuristic algorithm for the flowshop scheduling problem, Journal of the Operational Research Society, 22, 39, 10.1057/jors.1971.18

Hamzadayı, 2020, An effective benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem, Computers & Operations Research, 123, 105006, 10.1016/j.cor.2020.105006

Kai, 2020, Parallel machine scheduling with position-based deterioration and learning effects in an uncertain manufacturing system, Computers & Industrial Engineering, 149

Khare, 2021, Effective heuristics and metaheuristics to minimise total tardiness for the distributed permutation flowshop scheduling problem, International Journal of Production Research, 59, 7266, 10.1080/00207543.2020.1837982

Laha, 2009, A heuristic to minimize total flow time in permutation flow shop, Omega, 37, 734, 10.1016/j.omega.2008.05.002

Liao, 2013, Computational results for an automatically tuned CMA-ES with increasing population size on the CEC’05 benchmark set, Soft Computing, 17, 1031, 10.1007/s00500-012-0946-x

Liao, 2015, Performance evaluation of automatically tuned continuous optimizers on different benchmark sets, Applied Soft Computing, 27, 490, 10.1016/j.asoc.2014.11.006

Liu, 2001, Constructive and composite heuristic solutions to the P//∑ Ci scheduling problem, European Journal of Operational Research, 132, 439, 10.1016/S0377-2217(00)00137-5

López-Ibáñez, 2016, The irace package: Iterated racing for automatic algorithm configuration, Operations Research Perspectives, 3, 43, 10.1016/j.orp.2016.09.002

Lu, 2022, A Pareto-based collaborative multi-objective optimization algorithm for energy-efficient scheduling of distributed permutation flow-shop with limited buffers, Robotics and Computer-Integrated Manufacturing, 74, 102277, 10.1016/j.rcim.2021.102277

Lu, 2023, Human-Robot collaborative scheduling in energy-efficient welding shop, IEEE Transactions on Industrial Informatics

Naderi, 2010, The distributed permutation flowshop scheduling problem, Computers & operations research, 37, 754, 10.1016/j.cor.2009.06.019

Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, Omega, 11, 91, 10.1016/0305-0483(83)90088-9

Neufeld, 2016, A comprehensive review of flowshop group scheduling literature, Computers & Operations Research, 70, 56, 10.1016/j.cor.2015.12.006

Neufeld, 2020, Scheduling flowline manufacturing cells with inter-cellular moves: non-permutation schedules and material flows in the cell scheduling problem, International Journal of Production Research, 58, 6568, 10.1080/00207543.2019.1683251

Pagnozzi, 2019, Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems, European journal of operational research, 276, 409, 10.1016/j.ejor.2019.01.018

Palmer, 1965, Sequencing jobs through a multi-stage process in the minimum total time—a quick method of obtaining a near optimum, Journal of the Operational Research Society, 16, 101, 10.1057/jors.1965.8

Pan, 2019, Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem, Expert Systems with Applications, 124, 309, 10.1016/j.eswa.2019.01.062

Pan, 2021, Multi-trip time-dependent vehicle routing problem with time windows, European Journal of Operational Research, 291, 218, 10.1016/j.ejor.2020.09.022

Rajendran, 1993, Heuristic algorithm for scheduling in a flowshop to minimize total flowtime, International Journal of Production Economics, 29, 65, 10.1016/0925-5273(93)90024-F

Rivera, 2022, Outranking-based multi-objective PSO for scheduling unrelated parallel machines with a freight industry-oriented application, Engineering Applications of Artificial Intelligence, 108, 104556, 10.1016/j.engappai.2021.104556

Ruiz, 2019, Iterated Greedy methods for the distributed permutation flowshop scheduling problem, Omega, 83, 213, 10.1016/j.omega.2018.03.004

Shao, 2021, Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem, Computers & Operations Research, 136, 105482, 10.1016/j.cor.2021.105482

Yu, 2018, A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility, Computers & Operations Research, 100, 211, 10.1016/j.cor.2018.07.025

Zhang, 2021, A collaborative variable neighborhood descent algorithm for the hybrid flowshop scheduling problem with consistent sublots, Applied Soft Computing, 106, 107305, 10.1016/j.asoc.2021.107305

Zhang, 2022, An automatic multi-objective evolutionary algorithm for the hybrid flowshop scheduling problem with consistent sublots, Knowledge-Based Systems, 238, 107819, 10.1016/j.knosys.2021.107819