References

References
Aarts, E. & Lenstra, J. K., eds (1997), Local Search in Combinatorial Optimization, John Wiley
& Sons.
Ahuja, R., Magnanti, T. & Orlin, J. (1993), Network Flows, Prentice Hall.
Van den Akker, J. M. (1994), LP Based Solution Methods for Single-Machine Scheduling Problems, Ph. D. Thesis, Technische Universiteit Eindhoven.
Van den Akker, J. M., Van Hoesel, C. P. M. & Savelsbergh, M. W. P. (1999), ‘A Polyhedral Approach to Single-Machine Scheduling Problems’, Mathematical Programming 85(3), 541–
572.
Applegate, D., Bixby, R., Chvatal, V. & Cook, W. (2003), ‘The Concorde TSP Solver’,
http://www.tsp.gatech.edu/concorde/index.html.
Apt, K. R. (2003 )Principles of Constraint Programming, Cambridge University Press.
Baptiste, P. (1998), Une Étude Théorique Expérimentale de la Propagation des Contraintes de
Ressources, Ph. D. Thesis, Université de Compiègne.
Baptiste, P. & Le Pape, C. (1996a), ‘Disjunctive Constraints for Manufacturing Scheduling:
Principles and extensions’, International Journal of Computer Integrated Manufacturing
9(4), 306–310.
Baptiste, P. & Le Pape, C. (1996b), Edge-Finding Constraint Propagation Algorithms for Disjunctive and Cumulative Scheduling, in ‘Proc. 15th Workshop of the UK Planning Special
Interest Group’.
Bodlaender, H. (2005). Private Communications.
Brucker, P. & Thile, O. (1996), ‘A Branch and Bound Method for the General-Shop Problem
with Sequence Dependent Setup Times’, OR Spectrum 18, 145–161.
Carlier, J. (1984), Problèmes d’Ordonnancement à Contraintes de Ressources. Algorithmes et
Complexité, Ph. D. Thesis, Université Paris VI.
Carlier, J. & Pinson, E. (1989), ‘An Algorithm for Solving the Job Shop Problem’, Management
Science 32(2), 164–176.
Carlier, J. & Pinson, E. (1990), ‘A Practical Use of Jackson’s Preemptive Schedule for Solving
the Job-Shop Problem’, Annals of Operations Research 26, 269–287.
Caseau, Y. & Laburthe, F. (1994), Improved CLP Scheduling with Task Intervals, in ‘Proc. 11th
International Conference on Logic Programming, ICLP’94’.
204
References
Crama, Y. & Spieksma, F. C. R. (1995 ), ‘Scheduling Jobs of Equal Length: Complexity, Facets,
and Computational Results’, Integer Programming and Computer Science, 920, 277–291.
Dantzig, G. & Fulkerson, D. (1954), ‘Notes on Linear Programming: Part XV Minimizing the Number of Carriers to Meet a Fixed Schedule’, RAND Memorandum.
http://www.rand.org/pubs/research_memoranda/RM1328/.
Dinis, L. (1918-9), ‘Systems of Linear Inequalities’, Annals of Mathematics (2) 20, 191–199.
Dyer, M. & Wolsey, L. (1990), ‘Formulating the Single Machine Sequencing Problem with
Release Dates as a Mixed Integer Program’, Discrete Applied Mathematics 26, 255–270.
Erscher, J. (1976), Analyse sous Contraintes et Aide à la Décision pour Certains Problèmes
d’Ordonnancement, PhD Thesis, Université Paul Sabatier.
Esquirol, P. (1987), Règles et Processus d’Inférence pour l’Aide à l’Ordonnancement de tâche
en Présence de Contraintes, Ph. D. Thesis, Université Paul Sabatier.
Ford, L. & Fulkerson, D. (1957), ‘A Simple Algorithm for Finding Maximal Network Flows and
an Application to the Hitchcock Problem’, Canadian Journal of Mathematics 9, 210–218.
Fourier, J. (1827), ‘Analyse des Travaux de l’Academie Royale des Science, Pendant l’Année
1824, parie Mathématique’, Histoire de l’Académie Royale des Sciences de l’Institut de
France 7, xlvii–lv. [reprinted as: Second Extrait, in: Oeuvres de Fourier, Tome II (G. Darboux, ed.), Gautier-Villars, Paris, 1890 [reprinted: G. Olms, Hildesheim, 1970] pp. 325328] [English translation (partially) in D. A. Kohler, Translation of a Report by Fourier on
his Work on Linear Inequalities, Opsearch 10 (1973) 38-41].
Fox, B. (1990), Chronological and Non-Chronological Scheduling, in ‘Annual Conference on
Artificial Intelligence, Simulation and Planning in High Autonomy Systems, Tucson, Arizona, 1990.
Garey, M. & Johnson, D. (1979), Computers and Intractability; A Guide to the Theory of NPCompleteness, Freeman and Company.
GNU g++ Development Team (2005). The GNU C++ Compiler, http://gcc.gnu.org/.
Goldberg, A. (1985), A New Max-Flow Algorithm, Technical Report, Laboratory for Computer
Science, Massachusetts Institute of Technology, Cambridge, Massachusetts.
Goldberg, A. (1987), Efficient Graph Algorithms for Sequential and Parallel Computers,
Ph. D. Thesis.
Goldberg, A. & Tarjan, R. (1988), ‘A new Approach to the Maximum-Flow Problem’, Journal
of the Association for Computing Machinery 35, 921–940.
Gonzalez, T. & Sahni, S. (1978), ‘Flowshop and Jobshop Schedules: Complexity and Approximation’, Operations Research 26, 36–52.
Hammer, P. L., Johnson, E. L. & Peled, U. N. (1975), ‘Facets of Regular 0 − 1 Polytopes’,
Mathematical Programming 8, 179-206.
Hefetz, N. & Adiri, I. (1982), ‘An Efficient Optimal Algorithm for the Two-Machine Unit-Time
Jobshop Schedule-Length Problem’, Mathematics Operations Research 17, 238–248.
Hoogeveen, J. A. & Lennartz, P. (2005). Unpublished Work.
ILOG (2005). ILOG CPLEX v9.1: Changing the Rules of Business, http://www.ilog.fr.
Ivanescu, C. (2003). Private Communications.
Jackson, J. (1956), ‘An Extension of Jackson’s Results on Job Lot Scheduling’, Naval Res. Logist. Quart. 3, 201–203.
Jaffar, J., Michaylov, S., Stuckey, P. & Yap, R. (1992), ‘The CLP(∇) Language System’, ACM
Transactions on Programming Languages and Systems 14(3), 339–395.
References
205
Lawler, E., Lenstra, J. K., Rinnooy Kan, A. & Shmoys, D. B. (1993), ‘Sequencing and Scheduling: Algorithms and Complexity’, Handbooks in OR & MS 4, 445–522.
Lawler, E., Lenstra, J. K., Rinnooy Kan, A. & Shmoys, D. B., eds (1983), The Travelling Salesman Problem; a Guided Tour of Combinatorial Optimization, John Wiley & Sons.
Lennartz, P. (2005), http://www.cs.uu.nl/staff/peterl/CONGO.tar.bz2.
Lenstra, J. K. & Rinnooy Kan, A. (1979), ‘Computational Complexity of Discrete Optimization
Problems’, Ann. Discrete. Math. 4, 121–140.
Lenstra, J. K., Rinnooy Kan, A. & Brucker, P. (1977), ‘Complexity of Machine Scheduling
Problems’, Ann. Discrete. Math. 1, 343–362.
Lévy, M. (1996), Méthode par Décomposition Temporelle et Problémes d’Ordonnancement,
Ph. D. Thesis, Institut National Polytechnique de Toulouse.
Lock, H. (1996), An Implementation of the Cumulative Constraint, Technical Report, Universität Karlsruhe.
Maffioli, F. & Sciomachen, S. (1997), ‘A Mixed-Integer Model for Solving Ordering Problems
with Side Constraints’, Annals of Operations Research 7, 326–329.
Martin, P. & Shmoys, D. B. (1996), A New Approach to Computing Optimal Schedules for the
Job Shop Problem, in ‘Proc. 5th Conference on International Programming and Combinatorial Optimization’.
Motzkin, T. (1936), Beiträge zur Theorie der Linearen Ungleichungen, Ph. D. Thesis, (Inaugural
Dissertation Basel,) Azriel, Jerusalem.
Müller, T. (2005), ‘The Mozart Constraint Extensions Reference’, http://www.mozartoz.org/documentation/cpitut/.
Nemhauser, G. & Wolsey, L. (1999), Integer and Combinatorial Optimization, John Wiley &
Sons Ltd.
Noon, C. & Bean, J. (1996), ‘An Efficient Transformation of the Generalized Traveling Salesman Problem’, INFOR 31.
Nuijten, W. (1994), Time and Resource Constrained Schedulig: a Constraint Satisfaction Approach, Ph. D. Thesis, Technische Universiteit Eindhoven.
Le Pape, C. (1988), Des Systèmes d’Ordonnancement Flexibles et Opportunistes, Ph. D. Thesis,
Université Paris XI.
Le Pape, C. (1994), ‘Implementation of Resource Constraints in Ilog Scheduler: A library for
the development of Constraint-Based scheduling systems’, Intelligent Systems Engineering
3, 55–66.
Baptiste, P., Le Pape, C. & Nuijten, W. (2001), Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems, Kluwer Academic Publishers.
Péridy, L. (1996), Le Problème de Job-Shop: Arbitrages et Ajustements, Ph. D. Thesis, Université de Technologie de Compiègne.
Pinedo, M. (1995), Scheduling: Theory, Algorithms and Systems, Prentice-Hall.
Pinson, E. (1988), Le Problème de Job-Shop, Ph. D. Thesis, Université Paris VI.
Rismondo, S., Confessore, G. & Giordani, S. (2005), ‘A Tabu Search Approach for No-Wait
Job-Shop Scheduling with Alternative Routes’, 7th Workshop on Models and Algorithms
for Planning and Scheduling Problems pp. 86–91.
Rossi, F., Van Beek, P. & Walsh, T., eds. (2006 )Handbook of Constraint Programming, to be
Published in August 2006.
Schrijver, A. (1986), Theory of Linear and Integer Programming, John Wiley & Sons Ltd.
206
References
Schrijver, A. (2003), Combinatorial Optimization; Polyhedra and Efficiency, Springer-Verlag.
Schuster, C. (2003), No-Wait Job-Shop-Scheduling: Komplexität und Local Search, Ph. D. Thesis, Universität Duisburg Essen.
Silicon Graphics (1994). The Standard Template Library, STL.
Smith, S. & Chang, C. (1993), Slack-Based Heuristics for Constraint Satisfaction Scheduling,
in ‘National Conference on Artificial Intelligence’.
Sousa, J. (1989), Time-Indexed Formulations of Non-Preemptive Single-Machine Scheduling
Problems, Ph. D. Thesis, Catholic University of Louvain, Louvain-la-Neuve.
Sousa, J. & Wolsey, L. (1992), ‘A Time Indexed Formulation of Non-Preemptive Single Machine Scheduling Problems’, Mathematical Programming 54.
Spieksma, F. C. R. (1992), Assignment and Scheduling Algorithms in Automated Manufacturing, Ph. D. Thesis, Technische Universiteit Eindhoven.
Stroustrup, B. (2000), The C++ Programming Language, Addison-Wesley Professional.
Sutherland, I. (1963), Sketchpad: A Man-Machine Graphical Communication System, in ‘Proceedings of the Spring Joint Computer Conference’, pp. 329–346.
The BOOST Development Team (2005). The BOOST C++ library v1.32. http://www.boost.org.
Torres, P. & Lopez, P. (2000), ‘On Not-First/Not-Last Constraints in Disjunctive Scheduling’,
European Journal of Operational Research 127, 332–343.
Varnier, C., Baptiste, P. & Legeard, B. (1993), Le Traitement des Contraintes Disjunctives
dans un Problème d’Ordonnancement: Exemple du Hoist Scheduling Problem, in ‘Journées
Francophones de Programmation Logique’.
Vilím, P. (2004 ), O(n log n) Filtering Algorithms for Unary Resource Constraint, in ‘Proceedings of CPAIOR’, pp. 335–347.
Wennink, M. (1995), Algorithmic Support for Automated Planning Boards, Ph. D. Thesis, Technische Universiteit Eindhoven.
Wismer, D. A. (1972), ‘Solution of the Flow Shop Scheduling Problem with no Intermediate
Queues’, Operations Research 20, 689–697.
Woeginger, G. (2005), ‘Inapproximability Results for No-Wait Job Shop Scheduling’, Operations Research Letters 32, 299–397.