/usr/share/mozart/doc/fdt/bib.html is in mozart-doc 1.4.0-8ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 | <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD><TITLE>Bibliography</TITLE><LINK href="ozdoc.css" rel="stylesheet" type="text/css"></HEAD><BODY><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="answers.html#label182"><< Prev</A></TD><TD><A href="index.html">- Up -</A></TD><TD><A href="idx.html#label193">Next >></A></TD></TR></TABLE><H1><A name="label192">Bibliography</A></H1><DL>
<DT><A name=Adams.88>[ABZ88]</A>
<DD><P>J. Adams, E. Balas, and D. Zawack.
The shifting bottleneck procedure for job shop scheduling.
<EM>Management science</EM>, 34(3):391-401, 1988.</P>
<DT><A name=Applegate.91>[AC91]</A>
<DD><P>David Applegate and William Cook.
A computational study of the job-shop scheduling problem.
<EM>Operations Research Society of America, Journal on Computing</EM>,
3(2):149-156, 1991.</P>
<DT><A name=Bartusch.83>[Bar83]</A>
<DD><P>Martin Bartusch.
<EM>Optimierung von Netzplänen mit Anordnungsbeziehungen bei knappen
Betriebsmitteln</EM>.
PhD thesis, Universität Passau, Fakultät für Mathematik und Informatik,
1983.</P>
<DT><A name=Baptiste.95a>[BLN95]</A>
<DD><P>Philippe Baptiste, Claude Le Pape, and Wim Nuijten.
Incorporating efficient operations research algorithms in constraint-based
scheduling.
In <EM>First International Joint Workshop on Artificial Intelligence and
Operations Research</EM>, 1995.</P>
<DT><A name=Caseau.94a>[CL94]</A>
<DD><P>Yves Caseau and François Laburthe.
Improved CLP scheduling with task intervals.
In <EM>International Conference on Logic Programming</EM>, pages 369-383,
1994.</P>
<DT><A name=Caseau.95>[CL95]</A>
<DD><P>Yves Caseau and François Laburthe.
Disjunctive scheduling with task intervals.
LIENS Technical Report 95-25, Laboratoire d'Informatique de l'Ecole Normale
Supérieure, 1995.</P>
<DT><A name=Carlier.89>[CP89]</A>
<DD><P>J. Carlier and E. Pinson.
An algorithm for solving the job-shop problem.
<EM>Management Science</EM>, 35(2):164-176, 1989.</P>
<DT><A name=Carlier.94>[CP94]</A>
<DD><P>J. Carlier and E. Pinson.
Adjustment of heads and tails for the job-shop problem.
<EM>European Journal of Operational Research</EM>, 78:146-161, 1994.</P>
<DT><A name=Garey.79>[GJ79]</A>
<DD><P>Michael R. Garey and David S. Johnson.
<EM>Computers and Intractability</EM>.
W.H. Freeman and company, 1979.</P>
<DT><A name=Henz.96>[Hen96]</A>
<DD><P>Martin Henz.
Don't be puzzled!
In <EM>Proceedings of the Workshop on Constraint Programming Applications, in
conjunction with the Second International Conference on Principles and
Practice of Constraint Programming (CP96)</EM>, Cambridge, Massachusetts,
USA, August 1996.</P>
<DT><A name=Martin.96>[MS96]</A>
<DD><P>Paul Martin and David B. Shmoys.
A new approach to computing optimal schedules for the job shop scheduling
problem.
In <EM>International Conference on Integer Programming and Combinatorial
Optimization, Vancouver</EM>, pages 389-403, 1996.</P>
<DT><A name=Muth.63>[MT63]</A>
<DD><P>J. F. Muth and G. L. Thompson.
<EM>Industrial Scheduling</EM>.
Prentice Hall, Englewood Cliffs, NJ, USA, 1963.</P>
<DT><A name=Nuijten.94>[Nui94]</A>
<DD><P>Wim Nuijten.
<EM>Time and resource constrained scheduling</EM>.
PhD thesis, Technical University Eindhoven, 1994.</P>
<DT><A name=Wuertz.96b>[Wür96]</A>
<DD><P>Jörg Würtz.
Oz Scheduler: A workbench for scheduling problems.
In M.G. Radle, editor, <EM>Eighth International Conference on Tools with
Artificial Intelligence</EM>, pages 149-156, Toulouse, France, 1996. IEEE,
IEEE Computer Society Press.</P>
</DL>
<TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="answers.html#label182"><< Prev</A></TD><TD><A href="index.html">- Up -</A></TD><TD><A href="idx.html#label193">Next >></A></TD></TR></TABLE><HR><ADDRESS><A href="http://www.ps.uni-sb.de/~schulte/">Christian Schulte</A> and <A href="http://www.ps.uni-sb.de/~smolka/">Gert Smolka</A><BR><SPAN class="version">Version 1.4.0 (20110908185330)</SPAN></ADDRESS></BODY></HTML>
|