An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem
From MaRDI portal
Publication:6113360
DOI10.1016/j.ejor.2023.03.038OpenAlexW4362704161MaRDI QIDQ6113360
Quan-ke Pan, Janis S. Neufeld, Liang Gao, Xuan He
Publication date: 11 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2023.03.038
Related Items (1)
Cites Work
- An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- Strong multi-commodity flow formulations for the asymmetric traveling salesman problem
- Total flow time minimization in a flowshop sequence-dependent group scheduling problem
- Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
- The two-machine sequence dependent flowshop scheduling problem
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
- A comprehensive review of flowshop group scheduling literature
- Two-machine shop scheduling problems with batch processing
- The time dependent traveling salesman problem: polyhedra and algorithm
- Models and algorithms for the traveling salesman problem with time-dependent service times
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- Multi-family scheduling in a two-machine reentrant flow shop with setups
- A review of TSP based approaches for flowshop scheduling
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
- Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant
- A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- Joint optimization of preventive maintenance and flexible flowshop sequence-dependent group scheduling considering multiple setups
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
This page was built for publication: An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem
