Minimizing Cycle Time in a Blocking Flowshop, Operations Research, vol.48, issue.1, pp.177-180, 2000. ,
DOI : 10.1287/opre.48.1.177.12451
Scheduling two-stage hybrid flow shop with availability constraints, Computers & Operations Research, vol.33, issue.5, pp.1399-1419, 2006. ,
DOI : 10.1016/j.cor.2004.09.034
An extension of two machine sequencing problem, Operations Research, vol.8, pp.10-22, 1971. ,
The -machine flowshop problem with unit-time operations and intree precedence constraints, Operations Research Letters, vol.33, issue.3, pp.263-266, 2005. ,
DOI : 10.1016/j.orl.2004.08.001
A review of TSP based approaches for flowshop scheduling, European Journal of Operational Research, vol.169, issue.3, pp.816-854, 2006. ,
DOI : 10.1016/j.ejor.2004.06.040
Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time, Mathematical Methods of Operational Research, vol.60, issue.1, pp.145-153, 2004. ,
DOI : 10.1007/s001860300336
URL : https://hal.archives-ouvertes.fr/inria-00123801
Dynamic Programming, 1957. ,
Branch and bound algorithm for the flow shop with multiple processors, European Journal of Operational Research, vol.51, issue.1, pp.88-99, 1991. ,
DOI : 10.1016/0377-2217(91)90148-O
A scheduling model for computer systems with two classes of processors, Proceedings of the Sagamore Computer Conference on Parallel Processing, pp.130-138, 1973. ,
DOI : 10.2172/4325121
Machine Sequencing Problem, Management Science, vol.16, issue.10, pp.630-637, 1970. ,
DOI : 10.1287/mnsc.16.10.B630
Minimizing makespan in a blocking flowshop using genetic algorithms, International Journal of Production Economics, vol.70, issue.2, pp.101-115, 2001. ,
DOI : 10.1016/S0925-5273(99)00104-8
Les problèmes d'ordonnancement: modélisation, complexité, algorithmes, 1988. ,
Two branch and bound algorithms for the permutation flow shop problem, European Journal of Operational Research, vol.90, issue.2, pp.238-251, 1996. ,
DOI : 10.1016/0377-2217(95)00352-5
An exact method for solving the multiprocessor flowshop, RAIRO - Operations Reseach, vol.34, issue.1, pp.1-25, 2000. ,
Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem, Management Science, vol.26, issue.7, pp.736-743, 1980. ,
DOI : 10.1287/mnsc.26.7.736
Exact solution of large-scale, asymmetric traveling salesman problems, ACM Transactions on Mathematical Software, vol.21, issue.4, pp.394-409, 1995. ,
DOI : 10.1145/212066.212081
Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops, Operations Research, vol.29, issue.3, pp.511-522, 1981. ,
DOI : 10.1287/opre.29.3.511
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests, Algorithm Engineering and Experimentation, Third International Workshop, pp.32-59, 2001. ,
DOI : 10.1007/3-540-44808-X_3
Solution of a Large-Scale Traveling-Salesman Problem, Journal of the Operations Research Society of America, vol.2, issue.4, pp.393-410, 1954. ,
DOI : 10.1287/opre.2.4.393
Modélisation et résolution par PLNE d'un problème réel d'ordonnancement avec contraintes de blocage, pp.216-217, 2000. ,
A heuristic algorithm for job shop scheduling. Energy Sources Technology Conference and Exhibition, 1999. ,
Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage, Management Science, vol.21, issue.9, pp.989-996, 1975. ,
DOI : 10.1287/mnsc.21.9.989
The complexity of job-shop and flow-shop scheduling, Mathematics of Operations Research, vol.1, 1976. ,
A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints, Computers & Operations Research, vol.39, issue.3, pp.629-636, 2012. ,
DOI : 10.1016/j.cor.2011.02.017
Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem, Operations Research, vol.12, issue.5, pp.655-679, 1964. ,
DOI : 10.1287/opre.12.5.655
Flowshop and Jobshop Schedules: Complexity and Approximation, Operations Research, vol.26, issue.1, pp.36-52, 1978. ,
DOI : 10.1287/opre.26.1.36
Méthode exacte et bornes inférieures pour le Job Shop avec contrainte de blocage particulière, 2008. ,
Metaheuristics for the deterministic hybrid flow shop problem, Proceeding of the International Conference on Industrial Engineering and Production Management, pp.136-145, 1999. ,
On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness, Journal of the Operational Research Society, vol.34, issue.7, pp.615-620, 1983. ,
DOI : 10.1057/jors.1983.142
Sequencing of jobs in some production system, European Journal of Operational Research, vol.125, issue.3, pp.535-550, 2000. ,
DOI : 10.1016/S0377-2217(99)00224-6
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annals of Discrete Mathematics, vol.5, pp.287-326, 1979. ,
DOI : 10.1016/S0167-5060(08)70356-X
FLOWSHOP SCHEDULING PROBLEM???, International Journal of Production Research, vol.7, issue.3, pp.241-247, 1969. ,
DOI : 10.1287/opre.15.1.71
M-stage flowshop by branch and bound, Operations Research, vol.9, pp.37-43, 1970. ,
Two-Stage, Hybrid Flowshop Scheduling Problem, Journal of the Operational Research Society, vol.39, issue.4, pp.359-364, 1988. ,
DOI : 10.1057/jors.1988.63
Schedules for a two-stage hybrid flowshop with parallel machines at the second stage, International Journal of Production Research, vol.7, issue.7, pp.1489-1502, 1991. ,
DOI : 10.1287/opre.36.3.445
A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process, Operations Research, vol.44, issue.3, pp.510-525, 1996. ,
DOI : 10.1287/opre.44.3.510
Scheduling in robotic cells: Complexity and steady state analysis, European Journal of Operational Research, vol.109, issue.1, pp.43-65, 1998. ,
DOI : 10.1016/S0377-2217(96)00333-5
Heuristic algorithms for the two-stage hybrid flowshop problem, Operations Research Letters, vol.21, issue.1, pp.43-53, 1997. ,
DOI : 10.1016/S0167-6377(97)00004-7
A branch-and-bound-based local search method for the flow shop problem, Journal of the Operational Research Society, vol.10, issue.10, pp.1076-1084, 2003. ,
DOI : 10.1007/3-540-44808-X_3
Optimal Scheduling of a Two-stage Hybrid Flow Shop, Mathematical Methods of Operations Research, vol.43, issue.1, pp.107-124, 2006. ,
DOI : 10.1007/978-3-642-80784-8_7
Stochastic Local Search. Foundations and Applications, 2005. ,
Outline for a Logical Theory of Adaptive Systems, Journal of the ACM, vol.9, issue.3, pp.297-314, 1962. ,
DOI : 10.1145/321127.321128
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard, European Journal of Operational Research, vol.89, issue.1, pp.172-175, 1996. ,
DOI : 10.1016/S0377-2217(96)90070-3
Optimal scheduling in a flow shop with mutliple processors. Paper presented at the TIMS/ORSA Joint National Meeting in New Orleans, pp.4-6, 1987. ,
Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment, European Journal of Operational Research, vol.72, issue.1, pp.102-114, 1994. ,
DOI : 10.1016/0377-2217(94)90333-6
Modified simulated annealing algorithms for the flow shop sequencing problem, European Journal of Operational Research, vol.81, issue.2, pp.388-399, 1995. ,
DOI : 10.1016/0377-2217(93)E0235-P
Improved genetic algorithm for the permutation flowshop scheduling problem, Computers & Operations Research, vol.31, issue.4, pp.593-606, 2004. ,
DOI : 10.1016/S0305-0548(03)00016-9
Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem, International Journal of Production Economics, vol.100, issue.2, pp.322-334, 2006. ,
DOI : 10.1016/j.ijpe.2004.12.025
Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, vol.1, issue.1, pp.61-68, 1954. ,
DOI : 10.1002/nav.3800010110
Experimental analysis of heuristics for the ATSP The Traveling Salesman Problem and Its Variations, pp.445-487, 2002. ,
An Application Of Effective Genetic Algorithms For Solving Hybrid Flow Shop Scheduling Problems, International Journal of Computational Intelligence Systems, vol.183, issue.8, pp.134-147, 2008. ,
DOI : 10.1016/j.jmatprotec.2006.09.022
Reducibility among combinatorial problems in complexiy of computer computations, pp.85-103, 1972. ,
Interstage Transportation Planning in the Deterministic Flow-Shop Environment, Operations Research, vol.35, issue.4, pp.556-564, 1987. ,
DOI : 10.1287/opre.35.4.556
Optimal Sequencing of a Single Machine Subject to Precedence Constraints, Management Science, vol.19, issue.5, pp.544-546, 1973. ,
DOI : 10.1287/mnsc.19.5.544
The Traveling Salesman Problem, 1985. ,
Minimizing makespan in hybrid flowshops. Operation Research Letters, pp.149-158, 1994. ,
Flowshop sequencing problems with limited buffer storage, International Journal of Production Research, vol.23, issue.11, pp.2085-2100, 1990. ,
DOI : 10.1057/jors.1972.52
Complexity of Machine Scheduling Problems, Annals of Discrete Mathematics, vol.1, pp.343-362, 1977. ,
DOI : 10.1016/S0167-5060(08)70743-X
Optimal planning of parts machining on a number of machines, Automat Remote Control, vol.12, pp.1972-1978, 1969. ,
An Improved Formulation for the Job-Shop Scheduling Problem, Journal of the Operational Research Society, vol.43, issue.11, pp.1047-1054, 1992. ,
DOI : 10.1057/jors.1992.162
Hybrid flow shop scheduling: A survey, Computers & Industrial Engineering, vol.37, issue.1-2, pp.57-61, 1999. ,
DOI : 10.1016/S0360-8352(99)00023-6
Scheduling multistage batch plants with parallel units and no interstage storage, Computers & Chemical Engineering, vol.32, issue.4-5, pp.671-693, 2008. ,
DOI : 10.1016/j.compchemeng.2007.02.002
A ???Branch-and-Bound??? Algorithm for the Exact Solution of the Three-Machine Scheduling Problem, Journal of the Operational Research Society, vol.16, issue.1, pp.89-100, 1965. ,
DOI : 10.1057/jors.1965.7
On the Job-Shop Scheduling Problem, Operations Research, vol.8, issue.2, pp.219-223, 1960. ,
DOI : 10.1287/opre.8.2.219
Ordonnancement de systèmes de production avec contraintes de blocage, Thèse, 2005. ,
Complexity of flowshop scheduling problems with a new blocking constraint, European Journal of Operational Research, vol.169, issue.3, pp.855-864, 2006. ,
DOI : 10.1016/j.ejor.2004.08.046
URL : https://hal.archives-ouvertes.fr/hal-00362665
Les problèmes d'ordonnancement dans les systèmes de production automatisés : Modèles, complexité et approches de résolution, Thèse, 2002. ,
A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, Omega, vol.11, issue.1, pp.91-95, 1983. ,
DOI : 10.1016/0305-0483(83)90088-9
Solving hybrid flow shop problem using energetic reasoning and global operations, Omega, vol.29, issue.6, pp.501-511, 2001. ,
DOI : 10.1016/S0305-0483(01)00040-8
A fast tabu search algorithm for the permutation flow-shop problem, European Journal of Operational Research, vol.91, issue.1, pp.160-175, 1996. ,
DOI : 10.1016/0377-2217(95)00037-2
The flow shop with parallel machines: A tabu search approach, European Journal of Operational Research, vol.106, issue.2-3, pp.226-253, 1998. ,
DOI : 10.1016/S0377-2217(97)00260-9
Simulated annealing for permutation flow-shop scheduling, Omega, vol.17, issue.6, pp.551-557, 1989. ,
DOI : 10.1016/0305-0483(89)90059-5
A study of integer programming formulations for scheduling problems, International Journal of Systems Science, vol.40, issue.1, pp.33-41, 1997. ,
DOI : 10.1057/palgrave.jors.0400410
Flowshop scheduling with limited temporary storage, Journal of the ACM, vol.27, issue.3, pp.533-549, 1980. ,
DOI : 10.1145/322203.322213
URL : http://dspace.mit.edu/bitstream/1721.1/845/1/P-0808-06596257.pdf
Branch-and-Bound methods for the multi-Processor Job Shop and Flow Shop scheduling problems, 1995. ,
Branch and bound crossed with GA to solve hybrid flowshops, European Journal of Operational Research, vol.107, issue.2, pp.389-400, 1998. ,
DOI : 10.1016/S0377-2217(97)00333-0
An adaptive branching rule for the permutation flow-shop problem, European Journal of Operational Research, vol.5, issue.1, pp.19-25, 1980. ,
DOI : 10.1016/0377-2217(80)90069-7
Note???Sequencing with Finite Intermediate Storage, Management Science, vol.23, issue.2, pp.216-217, 1976. ,
DOI : 10.1287/mnsc.23.2.216
A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan, European Journal of Operational Research, vol.109, issue.2, pp.321-329, 1998. ,
DOI : 10.1016/S0377-2217(98)00060-5
An iterated greedy algorithm for the flowshop scheduling problem with blocking, Omega, vol.39, issue.3, pp.293-301, 2011. ,
DOI : 10.1016/j.omega.2010.07.007
Machine aggregation heuristics in shop scheduling, Methods of Operational Research, vol.45, pp.303-314, 1983. ,
The Three-Machine No-Wait Flow Shop is NP-Complete, Journal of the ACM, vol.31, issue.2, pp.336-345, 1984. ,
DOI : 10.1145/62.65
A Branch-and-Bound Algorithm to Minimize the Makespan in a Flow-Shop with Blocking, Annals of Operations Research, pp.53-65, 2005. ,
Les problèmes d'ordonnancement avec contraintes disjonctives, 1964. ,
A comprehensive review and evaluation of permutation flowshop heuristics, European Journal of Operational Research, vol.165, issue.2, pp.479-494, 2005. ,
DOI : 10.1016/j.ejor.2004.04.017
Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics, European Journal of Operational Research, vol.165, issue.1, pp.34-54, 2005. ,
DOI : 10.1016/j.ejor.2004.01.022
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, European Journal of Operational Research, vol.177, issue.3, pp.2033-2049, 2007. ,
DOI : 10.1016/j.ejor.2005.12.009
The hybrid flow shop scheduling problem, European Journal of Operational Research, vol.205, issue.1, pp.1-18, 2010. ,
DOI : 10.1016/j.ejor.2009.09.024
Global lower bounds for flow shops with multiple processors, European Journal of Operational Research, vol.80, issue.1, pp.112-120, 1995. ,
DOI : 10.1016/0377-2217(93)E0326-S
Initial populations tests for genetic algorithm Flow-Shop scheduling problems solving with a special blocking Information Control Problems in Manufacturing. 13 th IFAC Symposium on Information Control problems in manufacturing, pp.1961-1966, 2009. ,
A genetic algorithm with genes-association recognition for flowshop scheduling problems, Journal of Intelligent Manufacturing, vol.33, issue.2, pp.1167-1177, 2012. ,
DOI : 10.1145/321127.321128
URL : https://hal.archives-ouvertes.fr/hal-01152555
A schedule algorithm for flexible flow lines with limited intermediate buffers Applied Stochastic Models and Data Analysis, pp.127-138, 1993. ,
Scheduling flexible flow lines with no in-process buffers, International Journal of Production Research, vol.9, issue.5, pp.1357-1367, 1995. ,
DOI : 10.1287/opre.36.3.445
Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers, Mathematical and Computer Modelling, vol.31, issue.13, pp.39-52, 2000. ,
DOI : 10.1016/S0895-7177(00)00110-2
A scheduling strategy for the flow shop problem in a system with two classes of processors, Proceedings of the Conference on Information and Systems Science, pp.645-649, 1972. ,
Advances in Metaheuristics for Hard Optimization, 2007. ,
DOI : 10.1007/978-3-540-72960-0
URL : https://hal.archives-ouvertes.fr/hal-01679310
Some efficient heuristic methods for the flow shop sequencing problem, European Journal of Operational Research, vol.47, issue.1, pp.65-74, 1990. ,
DOI : 10.1016/0377-2217(90)90090-X
A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage, European Journal of Operational Research, vol.152, issue.1, pp.96-114, 2004. ,
DOI : 10.1016/S0377-2217(02)00524-6
Heuristic methods for problems with blocking constraints solving Job-Shop scheduling, International Conference on Modelling and Simulation, 2010. ,
Complexity and Mathematical Model for Flowshop Problem Subject to Different Types of Blocking Constraint, IFAC Proceedings Volumes, vol.44, issue.1, 2011. ,
DOI : 10.3182/20110828-6-IT-1002.01887
URL : https://hal.archives-ouvertes.fr/hal-01294239
Mathematical Model and Lower Bound for Hybrid Flowshop Problem With Mixed Blocking Constraints, IFAC Proceedings Volumes, vol.45, issue.6, 2011. ,
DOI : 10.3182/20120523-3-RO-2023.00310
URL : https://hal.archives-ouvertes.fr/hal-01295409
Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems, Computers & Operations Research, vol.39, issue.11, pp.2520-2527, 2012. ,
DOI : 10.1016/j.cor.2011.12.022
URL : https://hal.archives-ouvertes.fr/hal-01162454
Mathematical Model and Lower Bound for Hybrid Flowshop Problem With Mixed Blocking Constraints, IFAC Proceedings Volumes, vol.45, issue.6, 2012. ,
DOI : 10.3182/20120523-3-RO-2023.00310
URL : https://hal.archives-ouvertes.fr/hal-01295409
An empirical analysis of integer programming formulations for the permutation flowshop, Omega, vol.32, issue.4, pp.285-293, 2004. ,
DOI : 10.1016/j.omega.2003.12.001
Les problèmes d'ordonnancement de type Flow-Shop Hybride : Etat de l'art. RAIRO -Recherche Opérationnelle, pp.117-183, 1999. ,
An integer linear-programming model for machine scheduling, Naval Research Logistics Quarterly, vol.6, issue.2, pp.131-140, 1959. ,
DOI : 10.1002/nav.3800060205
An effective hybrid genetic algorithm for flow shop scheduling with limited buffers, Computers & Operations Research, vol.33, issue.10, pp.2960-2971, 2006. ,
DOI : 10.1016/j.cor.2005.02.028
A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities, European Journal of Operational Research, vol.155, issue.2, pp.380-401, 2004. ,
DOI : 10.1016/S0377-2217(02)00873-1
Alternative Formulations of a Flow-shop Scheduling Problem, Journal of the Operational Research Society, vol.40, issue.4, pp.395-399, 1989. ,
DOI : 10.1057/jors.1989.58
Application of EM algorithm to flow-shop scheduling problems with a special blocking. ISEM, 2007. ,
URL : https://hal.archives-ouvertes.fr/inria-00600396
Application of EM algorithm to hybrid flow shop scheduling problems with a special blocking. Emerging Technologies and Factory Automation, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00600396
Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm, Computers & Operations Research, vol.36, issue.4, pp.1249-1267, 2009. ,
DOI : 10.1016/j.cor.2008.01.007