A comparative study of flow-shop algorithms, Operations Research, vol.23, pp.62-73, 1975. ,
Hierarchical branch and bound algorithm for computational grids, Future Generation Computer Systems, vol.28, pp.1168-1176, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00750691
Some applications of the "branch-and-bound" algorithm to the machine scheduling problem, Journal of the Operational Research Society, vol.17, pp.173-186, 1966. ,
Asynchronous parallel branch and bound and anomalies, Parallel Algorithms for Irregularly Structured Problems, pp.363-377, 1995. ,
Two branch and bound algorithms for the permutation flow shop problem, European Journal of Operational Research, vol.90, pp.238-251, 1996. ,
Combining multi-core and gpu computing for solving combinatorial optimization problems, Journal of Parallel and Distributed Computing, vol.73, pp.1563-1577, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00935890
A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem, European Journal of Operational Research, vol.96, pp.578-590, 1997. ,
Branch-and-bound algorithms using fuzzy heuristics for solving large-scale flow-shop scheduling problems, pp.21-35, 2003. ,
Different behaviour of a double branch-and-bound algorithm on fm-prmu-cmax and fm-block-cmax problems, Computers and Operations Research, vol.34, pp.938-953, 2007. ,
A hardware architecture for the branch and bound flowshop scheduling algorithm, Nordic Circuits and Systems Conference (NORCAS): NORCHIP International Symposium on System-on-Chip (SoC), pp.1-4, 2015. ,
Grid branch-and-bound for permutation flowshop, Parallel Processing and Applied Mathematics -9th International Conference, PPAM 2011, pp.21-30, 2011. ,
An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem, Computers and Operations Research, vol.81, pp.160-166, 2017. ,
A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation, European Journal of Operational Research, vol.257, pp.707-721, 2017. ,
A review and classification of heuristics for permutation flow-shop scheduling with makespan objective, Journal of the Operational Research Society, vol.55, pp.1243-1255, 2004. ,
, The Complexity of Flowshop and Jobshop Scheduling, vol.1, pp.117-129, 1976.
Trends in high-performance computing for engineering calculations, Philosophical Transactions of the Royal Society of London A: Mathematical, Physical and Engineering Sciences, vol.372, 2014. ,
Work stealing with private integer-vector-matrix data structure for multi-core branch-and-bound algorithms, Concurrency and Computation: Practice and Experience, vol.28, pp.4463-4484, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01248336
A gpu-based branch-and-bound algorithm using integervector-matrix data structure, Parallel Computing, vol.59, pp.119-139, 2016. ,
Improved upper bounds for permutation flowshop scheduling benchmarks (Taillard and VRF, 2019. ,
Flowshop-scheduling problems with makespan criterion: a review, International Journal of Production Research, vol.43, pp.2895-2929, 2005. ,
Application of the branch and bound technique to some flow-shop scheduling problems, Oper. Res, vol.13, pp.400-412, 1965. ,
Surrogate-assisted evolutionary computation: Recent advances and future challenges, Swarm and Evolutionary Computation, vol.1, pp.61-70, 2011. ,
Optimal two-and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, vol.1, pp.61-68, 1954. ,
An empirical analysis of the optimality rate of flow shop heuristics, European Journal of Operational Research, vol.198, pp.93-101, 2009. ,
The Art of Computer Programming, Seminumerical Algorithms, vol.2, 1997. ,
A computational study of the permutation flow shop problem based on a tight lower bound, Computers and Operations Research, vol.32, pp.1831-1847, 2005. ,
A General Bounding Scheme for the Permutation Flow-Shop Problem, Operations Research, vol.26, pp.53-67, 1978. ,
An exact parallel method for a bi-objective permutation flowshop problem, European Journal of Operational Research, vol.177, pp.1641-1655, 2007. ,
Coping with anomalies in parallel branch-and-bound algorithms, IEEE Transactions on Computers C, vol.35, pp.568-573, 1986. ,
A new improved neh heuristic for permutation flowshop scheduling problems, International Journal of Production Economics, vol.193, 2017. ,
A "branch-and-bound" algorithm for the exact solution of the three-machine scheduling problem, Journal of the Operational Research Society, vol.16, pp.89-100, 1965. ,
Flow-shop scheduling with the branch-and-bound method, Operations Research, vol.15, pp.473-481, 1967. ,
Multi-core versus many-core computing for many-task branchand-bound applied to big optimization problems, Future Generation Computer Systems, vol.82, pp.472-481, 2018. ,
A multi-core parallel branch-and-bound algorithm using factorial number system, 2014 IEEE 28th International Parallel and Distributed Processing Symposium, pp.1203-1212, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00934841
A multi-core parallel branch-and-bound algorithm using factorial number system, 2014 IEEE 28th International Parallel and Distributed Processing Symposium, pp.1203-1212, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00934841
A grid-enabled branch and bound algorithm for solving challenging combinatorial optimization problems, 2007 IEEE International Parallel and Distributed Processing Symposium, pp.1-9, 2007. ,
URL : https://hal.archives-ouvertes.fr/inria-00083814
On bound of makespans and its application in m machine scheduling problem, Journal of the Operations Research Society of Japan, vol.9, p.98, 1967. ,
A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, Omega, vol.11, pp.90088-90097, 1983. ,
An adaptive branching rule for the permutation flow-shop problem, European Journal of Operational Research, vol.5, pp.90069-90076, 1980. ,
Fifty years of scheduling: a survey of milestones, Journal of the Operational Research Society, vol.60, pp.41-68, 2009. ,
A branch-and-bound algorithm with cyclic best-first search for the permutation flow shop scheduling problem, IEEE International Conference on Automation Science and Engineering, pp.872-877, 2016. ,
Evaluation of high performance constructive heuristics for the flow shop with makespan minimization, The International Journal of Advanced Manufacturing Technology, vol.87, pp.125-136, 2016. ,
Two new robust genetic algorithms for the flowshop scheduling problem, Omega, vol.34, pp.461-476, 2006. ,
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, European Journal of Operational Research, vol.177, pp.2033-2049, 2007. ,
Introduction to reinforcement learning, vol.135, 1998. ,
Optimal elimination methods in the m× n flow-shop scheduling problem, Operations Research, vol.21, pp.1250-1259, 1973. ,
Benchmarks for basic scheduling problems, European Journal of Operational Research, vol.64, pp.278-285, 1993. ,
Flow shop sequencing: Summary of best known lower and upper bounds of Taillard's instances, 2015. ,
New hard benchmark for flowshop scheduling problems minimising makespan, European Journal of Operational Research, vol.240, pp.666-677, 2015. ,
Parallel branch-and-bound in multi-core multi-cpu multi-gpu heterogeneous environments, Future Generation Computer Systems, vol.56, pp.95-109, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01249124