INDEX TO EXAMPLES

CONSTRAINT LOGIC PROGRAMMING EXTENSIONS


Model file Represents
assign0.mod Job assignment problem, using n2 zero-one variables
assign1.mod . . . instead using n integer variables, with alldiff operator
assign2.mod . . . also using a variable as a subscript in the objective
assign3.mod . . . instead using n object-valued variables
flowshp0.mod Flowshop problem, using n2 zero-one variables
flowshp1.mod . . . instead using n integer variables, with the or operator
flowshp2.mod . . . instead using n integer variables, with the if-then operator
sched0.mod Job scheduling problem, using n2 zero-one variables
sched1.mod . . . instead using n integer variables, with the count operator
sched2.mod . . . instead using n integer variables, with the countof operator
seq0.mod Job sequencing problem, using n2 zero-one variables
seq1.mod . . . instead using 2n integer variables, with variables in subscripts
seq2.mod . . . also using min in constraint to define the finish times
seq0a.mod Like seq0.mod, but using a set of objects for jobs
seq1a.mod Like seq1.mod, but using object-valued variables for jobs


Sources

flowshop: J.N. Hooker and M.A. Osorio, "Mixed Logical/Linear Programming." Technical report, Carnegie Mellon University, Pittsburgh, PA (July 1996).

seq: C. Jordan and A. Drexl, "A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups." ORSA Journal on Computing 7 (1995) 160-165.



Comments or questions?
Write to info@ampl.com or use our comment form.

Return to the AMPL proposed new features page.

Return to the AMPL update page.

Return to the AMPL home page.


LAST MODIFIED 7 FEBRUARY 1996 BY 4er@iems.nwu.edu.