í A computational study of local search algorithms for job shop scheduling, ORSA Journal on Computing, vol.6, issue.2, 1994. ,
The Shifting Bottleneck Procedure for Job Shop Scheduling, Management Science, vol.34, issue.3, 1988. ,
DOI : 10.1287/mnsc.34.3.391
í An eaecient algorithm for the twomachine , unit-time, job-shop schedule length problem, Mathematics of Operations Research, vol.7, 1982. ,
í Ordonnancement de Production avecCo^ uts de Changements, Th ese de PhD, Institut National Polytechnique de Grenoble, INPG. í Design and implementation of a scheduling software system. In : System , Man and Cybernetics Conference, 1993. ,
í A graphical approach to production scheduling problems, ë7ë Appelgate D.. et Cook W... í A computational study of jobshop scheduling, 1956. ,
An optimal schedule time of a job shop-like disjunctive graph, 146 BIBLIOGRAPHIE ë9ë Baker K. R... í Introduction to Sequencing and Scheduling.í Wiley, 1973. ,
DOI : 10.1002/net.3230030405
Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm, Operations Research, vol.17, issue.6, 1969. ,
DOI : 10.1287/opre.17.6.941
On the facial structure of scheduling polyhedra, Mathematical Programming Studies, vol.24, 1985. ,
DOI : 10.1007/BFb0121051
Scheduling the General Job-Shop, ë13ë Bellman R... í Dynamic Programming, 1957. ,
DOI : 10.1287/mnsc.31.5.594
IntelligenceA rtiaecielle pour l'Ordonnancement d'Atelier.í Th ese de PhD, Ecole Nationale Sup erieure de l'A eronautique et de l'Espace. í A state-of-theart survey of dispatching rules for manufacturing job-shop operations programming formulations for machine scheduling: A survey, International Journal of Production Research ë16ë Blazewicz J.., Dror M.. et Weglarz J... í Mathematical European Journal of Operational Research, vol.20, issue.51, 1982. ,
í Scheduling in aeexible manufacturing systems, í Scheduling tasks and vehicles in a aeexible manufacturing system. International Journal of aeexible manufacturing systems, 1991. ,
A Comparison of three Enumeration Schemes in a Branch and Bound Approach, 1982. ,
í The schedule sequencing problem. í An algorithm for aending optimal or near optimal solution to the production scheduling problem, Operations Research Journal of Industrial Ingineering, vol.7, issue.16 1, 1959. ,
í An eaecient algorithm for the job-shop problem with two jobs, Computing, vol.40, 1988. ,
A new lower bound for the job-shop scheduling problem, Second International Workshop on Project Management and Scheduling, EURO WG-PMS, 1990. ,
DOI : 10.1016/0377-2217(93)90174-L
í Job-shop scheduling with multipropose machine, Computing, vol.45, 1990. ,
í One machine problem, European Journal of Operational Research, vol.11, 1982. ,
í Probl emes d'Ordonnancements ac ontraintes de Ressources : Algorithmes et Complexit e.í Th ese d' etat, 1984. ,
í An algorithm for solving the jobshop problem, Management Science, vol.35, 1989. ,
í A practical use of jackson's preemptiveschedule for solving the job-shop problem, Annals of Operations Research, vol.26, 1990. ,
í Theory of scheduling, 1967. ,
í Minimax Algebra, 1979. ,
DOI : 10.1007/978-3-642-48708-8
í A genetic algorithm for jobshop, IEEE International ConferenceonRobotics and Automation, 1991. ,
í Optimal solution of scheduling problems using lagrange multipliers : Part 1, Operations Research, vol.21, 1973. ,
í Optimal solution of scheduling problems using lagrange multipliers : Part 2, Symposium on the Theory of Scheduling and its Applications, 1973. ,
A dual algorithm for the one-machine scheduling problem, Mathematical Programming, vol.18, issue.3, 1976. ,
DOI : 10.1007/BF01580393
í The lagrangian relaxation method for solving integer programming problems, Management Science, vol.27, 1981. ,
í Surrogate duality relaxation for job-shop scheduling í An implicitenumeration algorithm for the machine sequencing problem, Discrete Applied Mathematics Management Science, vol.5, issue.12, 1971. ,
í Sequencing and Scheduling : An Introduction to the Mathematics of the Job-Shop, 1982. ,
í The complexity of aeow-shop and job-shop scheduling, Mathematics of Operations Research, vol.1, 1976. ,
Selecting allowance policies for improved job shop performance, International Journal of Production Research, vol.23, issue.8, 1993. ,
DOI : 10.1080/00207549308956826
í Lagrangean relaxation for integer programming, Mathematical Programming Studies, vol.3, 1974. ,
í Algorithms for solving production scheduling problems, Operations Research, vol.8, issue.4, 1960. ,
í Tabu search, part 1, ORSA Journal on Computing, vol.1, issue.3, 1989. ,
í Tabu search, part 2, ORSA Journal on Computing, vol.2, issue.1, 1990. ,
í Flow-shop and job-shop scheduling : Complexity and approximation, Operations Research, vol.26, 1978. ,
í Les probl emes d'ordonnancement, RAIRO-RO, vol.27, issue.1, 1993. ,
í Geometric Algorithms and Combinatorial Optimization, 1988. ,
í Reduction of job-shop problems to aeow-shop problems with precedence constraints, 1994. ,
í Production and inventory management .í Englewood Cliaes í A dynamic programming approach to sequencing problems, Journal of SIAM, 1962. ,
í Adaptation in Natural and Artiaecial Systems. í The University of, 1975. ,
í Neural networks and physical systems with emergent collective computational abilities, Proceeding of the National Academy of Science, 1969. ,
í An extension of Johnson's results on job lot scheduling, Naval Research Logistic Quarterly, vol.3, issue.3, 1956. ,
í Optimal two and three stage production schedules, Naval research Logistic Quarterly, vol.1, issue.1, 1954. ,
Simulation studies of multilevel dynamic job shop scheduling using heuristic dispatching rules, Journal of Manufacturing Systems, vol.11, issue.5, 1992. ,
DOI : 10.1016/0278-6125(92)90063-L
í Optimization by simulated annealing: Quantitative studies í Optimization by simulated annealing, Journal of Statistical Physics Science, vol.34, issue.220 ë69ë, 1983. ,
Job-Shop Scheduling by Implicit Enumeration, Management Science, vol.24, issue.4, 1977. ,
DOI : 10.1287/mnsc.24.4.441
edit e parr. í The Traveling Salesman Problem: A GuidedT our of Combinatorial Optimization, 1987. ,
Branch-and-Bound Methods: A Survey, Operations Research, vol.14, issue.4, 1966. ,
DOI : 10.1287/opre.14.4.699
í Caract erisation d'un ensemble d'ordonnancements avec contraintes de ressources de type cumulatif, 1992. ,
í Ordonnancement d'Atelier aT^ aches : Une Approche par D ecomposition.í Th ese de PhD, 1991. ,
An Improved Formulation for the Job-Shop Scheduling Problem, Journal of the Operational Research Society, vol.43, issue.11, 1992. ,
DOI : 10.1057/jors.1992.162
í Ordonnancementde t^ aches sous contraintes : une approche energ etique, 1992. ,
í Local optimization and the job-shop scheduling problem, 1994. ,
í On the job-shop scheduling problem, Operations Research, vol.8, 1960. ,
í A ControlledSearch SimulatedAnnealing Method for the General Job-Shop Scheduling Problem. í Rapport technique n 03-44-88, 1988. ,
í A logical calculus of ideas immanent in nervous activity, Bulletin of Mathematical Biophysics, vol.3, 1943. ,
í Branch and bound methods : General formulation and properties, Operations Research, vol.18, 1970. ,
í Conventional genetic algorithm for job-shop problems, Conference on Genetic Algorithms, 1991. ,
A Survey of Scheduling Rules, Operations Research, vol.25, issue.1, 1977. ,
DOI : 10.1287/opre.25.1.45
í Combinatorial Optimization : Algorithms and Complexity, N.J, 1982. ,
í New heuristics for the job-shop problem, International Conference on industrial Engineering and Production Management, 1993. ,
í LePr obl eme de Job-Shop.í Th ese de PhD, 1988. ,
í M ethodes de d ecomposition spatiale et temporelle en ordonnancement de la production, APII, vol.22, 1988. ,
Analysis of a linear programming heuristic for scheduling unrelated parallel machines, Discrete Applied Mathematics, vol.10, issue.2, 1985. ,
DOI : 10.1016/0166-218X(85)90009-5
í Structure of a simple scheduling polyhedron. í Single-machine scheduling polyhedra with precedence constraints, Mathematical Programming, 1991. ,
í The job-shop tardiness problem : A decomposition approach, European Journal of Operational Research, vol.69, 1993. ,
Dynamic job shop scheduling: A survey of simulation research, Omega, vol.18, issue.1, 1990. ,
DOI : 10.1016/0305-0483(90)90017-4
Algebraic, mathematical programming, and network models of the deterministic job-shop scheduling problem, IEEE Transactions on Systems, Man, and Cybernetics, vol.21, issue.3, 1991. ,
DOI : 10.1109/21.97463
Perceptron Simulation Experiments, Proceeding of the IRE, 1960. ,
DOI : 10.1109/JRPROC.1960.287598
í Les Probl emes d'ordonnancement avecc ontraintes disjonctives.í Rapport technique n D. S. 9, SEMA, ë99ë Schwefel H.-P... í Numerische Optimierung von Computer- Modellen mittels der Evolutionsstrategie.í Birkhí auser Verlag, 1964. ,
í Two machine super-shop scheduling problem í A dioid algebra approach for modeling the job-shop scheduling problem, Journal of Operational Research Society, vol.42, issue.6, 1991. ,
Parallel Taboo Search Techniques for the Job Shop Scheduling Problem, ORSA Journal on Computing, vol.6, issue.2, 1994. ,
DOI : 10.1287/ijoc.6.2.108
í Job-shop scheduling by simulated annealing í Two-stage heuristic procedure for scheduling job-shops, Operations Research Journal of Manufacturing Systems, vol.40, issue.12 4, 1992. ,
Priority Rules for Job Shops with Weighted Tardiness Costs, Management Science, vol.33, issue.8, 1987. ,
DOI : 10.1287/mnsc.33.8.1035
Dynamic rules for due-date assignment, ë110ë Wagner H. M... í An integer linear programming model for machine scheduling. Naval Research Logistic Quarterly, 1959. ,
DOI : 10.1287/mnsc.25.4.363
í A broader view of the job-shop scheduling problem í The impact of processing time knowledge on dynamic job-shop scheduling, Management Science ë112ë Wein L. M.. et Ou J... Management Science, vol.38, issue.8, 1991. ,
Insertion techniques for the heuristic solution of the job shop problem, Discrete Applied Mathematics, vol.58, issue.2, 1991. ,
DOI : 10.1016/0166-218X(93)E0127-K
í Job shop scheduling with tooling constraints: a tabu search approach, Journal of the Operational Research Society, vol.42, issue.1, 1991. ,
í Solving job-shop scheduling problem with priority using neural network. í, 1991. ,
A neural network approach to job-shop scheduling, IEEE Transactions on Neural Networks, vol.2, issue.1, 1991. ,
DOI : 10.1109/72.80311