ian miguel tjltdcsstandacuk apologies multiple copies first constraint modelling challenge httpwwwdcsstandacukipgchallenge conjunction fifth workshop modelling solving problems constraints 31 july 2005 ijcai 05 edinburgh organisers barbara smith cork constraint computation centre ireland ian gent university st andrews scotland prize generously supported uk symmetry search network pleased announce first constraint modelling challenge fields sat planning theorem proving regular competitions proved extremely fruitful pushing field date similar attempt made constraints challenge community provide constraint models problem described submit short papers describing models best paper win small prize value 100 chosen problem seen manufacturing scheduling problem also equivalent pathwidth despite importance problem theory constraints extensive algorithmic literature little understanding model solve problem using constraints first constraint modelling challenge model problem constraint problem constraint programming constraint logic programming language choice restrictions languages may use describe problem challenge detail problem minimizing maximum number open stacks fink voss reference manufacturer number orders customers satisfy order number different products one product made time customers order started ie first product order made stack created customer products customer requires made order sent customer stack closed limited space production area number stacks use simultaneously ie number customer orders simultaneous production minimized formally given boolean matrix columns correspond products required customers row corresponds order particular customer entry c_ij 1 iff customer ordered quantity product j quantity ordered irrelevant objective find permutation products maximum number open orders point sequence minimized order open point k production sequence product required order appears position k sequence also product appears position k sequence challenge challenge opens immediately run three stages first stage development benchmark suite testing initial set instances already available add instances initial phase participants challenge option submit instances together best known results indication whether optimality known organisers select instances uploaded broaden scope benchmark set help us find interesting hard instances challenge community solutions initial instances known participants solve optimally find good solutions notify organisers add information web site second stage set benchmarks challenge fixed entrants required present results instances stage together whether optimality proved declare unable solve certain instances final stage presentation results workshop ijcai 05 given limited time available organisers present report competition workshop means entrants wont chance present work person allow us draw together ideas may occurred multiple entries variety tools available entrants means awarding prize fastest run times reported instead organizers award prize best paper based judgment quality analysis writing paper well modelling ideas used prize best paper value approximately 100 supported symnet uks symmetry search network plan submit benchmark instances csplib pointer web page submitted papers available authors asked whether agree publication work immediately workshop please address correspondence entries alfvhbapi30dcsstandacuk entry challenge submission short paper maximum 4 pages ijcai format submission deadline listed additionally 4 pages appendix present results benchmark set format decided close first stage papers may course mention unsuccessful modelling ideas well author found work best papers put challenge website distributed workshop code used generate results submitted organisers entrants decide whether wish make code public website important dates 7 june 2005 benchmark suite challenge fixed 29 june 2005 deadline entries challenge 31 july 2005 report challenge ijcai 05 workshop modelling solving problems constraints pointers literature problem described andreas fink stefan voss applications modern heuristic search methods pattern sequencing problems computers operations research 26 pp 1734 1999 fink voss cite several papers problem using variety operations research techniques following paper lists several equivalent problems including graph pathwidth alexandre linhares haracio hideki yanasse connections cuttingpattern sequencing vlsi design flexible machines computers operations research 29 pp 17591772 2002 one starting point algorithms literature pathwidth hans l bodlaender treewidth algorithmic techniques results proceedings 22nd international symposium mathematical foundations computer science mfcs97 lecture notes computer science volume 1295 igor privara peter ruzicka editors springerverlag berlin 1997 p 2936 httpwwwcsuunlhansbmypapershtml wed 06 aug 2008 110205 0100 uai first constraint modelling challenge