Constraint logic programming for examination timetabling
In this paper, we present an application of constraint logic programming to the examination timetabling problem of our university. Each year, in June, 4000 students in various programs must attend examinations during a couple of weeks for academic reasons. A set of examinations must be planned on sp...
Saved in:
| Published in: | The journal of logic programming Vol. 26; no. 2; pp. 217 - 233 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Inc
01.02.1996
|
| ISSN: | 0743-1066, 1873-5789 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | In this paper, we present an application of constraint logic programming to the examination timetabling problem of our university. Each year, in June, 4000 students in various programs must attend examinations during a couple of weeks for academic reasons. A set of examinations must be planned on specific half-days over a collection of rooms of different capacities. Various kinds of constraints must be taken into account. In particular, several examinations can be assigned to the same room if they respect the capacity constraint. This problem has been identified by operations researchers as a scheduling problem with disjunctive and cumulative conjunctive constraints and is classified as NP-complete. However no classical operations research (OR) approach is directly applicable. Our application has been developed using constraint logic programming over finite domains. First, we give a brief overview of OR approaches for solving examination timetabling problems. Then we describe the examination timetabling problem for our university and show how constraint logic programming over finite domains can be used to solve it efficiently. Finally, we illustrate the important potentialities of constraint logic programming for the prototyping and implementation of real-life applications. |
|---|---|
| AbstractList | In this paper, we present an application of constraint logic programming to the examination timetabling problem of our university. Each year, in June, 4000 students in various programs must attend examinations during a couple of weeks for academic reasons. A set of examinations must be planned on specific half-days over a collection of rooms of different capacities. Various kinds of constraints must be taken into account. In particular, several examinations can be assigned to the same room if they respect the capacity constraint. This problem has been identified by operations researchers as a scheduling problem with disjunctive and cumulative conjunctive constraints and is classified as NP-complete. However no classical operations research (OR) approach is directly applicable. Our application has been developed using constraint logic programming over finite domains. First, we give a brief overview of OR approaches for solving examination timetabling problems. Then we describe the examination timetabling problem for our university and show how constraint logic programming over finite domains can be used to solve it efficiently. Finally, we illustrate the important potentialities of constraint logic programming for the prototyping and implementation of real-life applications. |
| Author | Delon, Y Peridy, L Boizumault, P |
| Author_xml | – sequence: 1 givenname: P surname: Boizumault fullname: Boizumault, P organization: Ecole des Mines de Nantes, 4, rue Alfred Kastler, La Chantrerie, 44070 Nantes Cedex 03, France – sequence: 2 givenname: Y surname: Delon fullname: Delon, Y organization: Institut de Mathématiques Appliquées, Université Catholique de l'Ouest, 3 Place André Leroy, B.P. 808, 49008, ANGERS Cedex 01, France – sequence: 3 givenname: L surname: Peridy fullname: Peridy, L organization: Institut de Mathématiques Appliquées, Université Catholique de l'Ouest, 3 Place André Leroy, B.P. 808, 49008, ANGERS Cedex 01, France |
| BookMark | eNqFj8tKAzEUhoNUsFbfwMUsdTGadCY3F4IUb1Bwo9BdSDMnJTKTlCSIvr2ZVly40M25cM73w3eMJj54QOiM4EuCCbvCvG1qghk7l_QCY4JxvTpAUyJ4U1Mu5ARNf16O0HFKb7h8EUKnSCyCTzlq53PVh40z1TaGTdTD4PymsiFW8KHLrLMLvspugKzXfbmdoEOr-wSn332GXu_vXhaP9fL54Wlxu6xNg9tcE0oJZZwxCdgyygyxwEEKYSinMLcStNDQUFtq22nGykoF53NO5Jp1opmhdp9rYkgpglXb6AYdPxXBarRXo5oa1ZSkamevVgW7_oUZl3cSo2z_H3yzh6GIvTuIKhkH3kDnIpisuuD-DvgCH1Z1oA |
| CitedBy_id | crossref_primary_10_1016_j_asoc_2013_09_003 crossref_primary_10_1016_j_procs_2018_08_024 crossref_primary_10_1016_j_cor_2007_12_007 crossref_primary_10_1080_07408170490438410 crossref_primary_10_1016_S0377_2217_98_00248_3 crossref_primary_10_1007_s40092_019_00330_2 crossref_primary_10_1023_B_ANOR_0000030684_30824_08 crossref_primary_10_1007_s00291_006_0034_7 crossref_primary_10_1007_s12597_022_00590_4 crossref_primary_10_1016_j_asoc_2015_11_043 crossref_primary_10_1007_s10479_011_0999_8 crossref_primary_10_1007_s10951_008_0077_5 crossref_primary_10_1002_int_20115 crossref_primary_10_1007_s00291_007_0097_0 crossref_primary_10_1016_j_eswa_2010_12_116 crossref_primary_10_1016_j_swevo_2012_06_004 crossref_primary_10_1016_j_ins_2011_12_018 |
| Cites_doi | 10.1093/comjnl/33.4.356 10.1287/ijoc.2.1.4 10.1007/BF02239976 10.1016/0377-2217(85)90167-5 10.1287/mnsc.30.12.1473 10.1016/0743-1066(94)90033-7 10.1057/jors.1978.237 10.1016/S0743-1066(98)10006-7 10.1287/opre.34.2.193 10.1002/spe.4380230204 10.1016/0377-2217(90)90350-K 10.1016/0895-7177(94)90127-9 10.1093/comjnl/11.1.41 10.1016/0004-3702(80)90051-X 10.1007/978-3-7091-9076-0_10 10.1287/ijoc.1.3.190 |
| ContentType | Journal Article |
| Copyright | 1996 |
| Copyright_xml | – notice: 1996 |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/0743-1066(95)00100-X |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1873-5789 |
| EndPage | 233 |
| ExternalDocumentID | 10_1016_0743_1066_95_00100_X 074310669500100X |
| GroupedDBID | --K --M -~X .~1 0R~ 0SF 123 1B1 1RT 1~. 1~5 29K 4.4 4G. 5VS 6I. 7-5 71M 8P~ AACTN AAEDT AAEDW AAFTH AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABMAC ABVKL ABXDB ABYKQ ACDAQ ACGFS ACNCT ACNNM ACRLP ADBBV ADEZE ADMUD AEKER AETEA AEXQZ AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 D-I D0L EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBOLZ HVGLF HZ~ IHE IXB KOM KQ8 LG9 M26 M41 MO0 NCXOZ O-L O9- OAUVE OK1 OZT P-9 PC. Q38 R2- ROL RPZ SDF SDG SEW SPC SSV SSZ T5K TN5 UHS WUQ XJT 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c304t-1551567669e0f656c1fe7e988c575e2f9ea8ae35f8ae4da66a8a58772719b6d83 |
| ISICitedReferencesCount | 44 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=074310669500100X&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0743-1066 |
| IngestDate | Sat Nov 29 06:24:12 EST 2025 Tue Nov 18 21:48:37 EST 2025 Fri Feb 23 02:34:25 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Issue | 2 |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c304t-1551567669e0f656c1fe7e988c575e2f9ea8ae35f8ae4da66a8a58772719b6d83 |
| OpenAccessLink | https://dx.doi.org/10.1016/0743-1066(95)00100-X |
| PageCount | 17 |
| ParticipantIDs | crossref_primary_10_1016_0743_1066_95_00100_X crossref_citationtrail_10_1016_0743_1066_95_00100_X elsevier_sciencedirect_doi_10_1016_0743_1066_95_00100_X |
| PublicationCentury | 1900 |
| PublicationDate | 1996-02-01 |
| PublicationDateYYYYMMDD | 1996-02-01 |
| PublicationDate_xml | – month: 02 year: 1996 text: 1996-02-01 day: 01 |
| PublicationDecade | 1990 |
| PublicationTitle | The journal of logic programming |
| PublicationYear | 1996 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Aggoun, Beldiceanu (BIB1) 1992 Boufflet, Negre (BIB7) 1994 (BIB12) 1993 Feldman, Golumbic (BIB23) 1990; 33 Fages, Fowler, Sola (BIB22) 1994 Barham, Westwood (BIB8) 1978; 29 Tsang (BIB42) 1993 Jaffar, Maher (BIB32) 1994 Hertz, de Werra (BIB26) 1987; 39 Van Hentenryck, Saraswat, Deville (BIB31) 1992 Van Hentenryck (BIB30) 1992 Tripathy (BIB41) 1984; 30 Van Hentenryck (BIB28) 1989 Carter (BIB9) 1986; 34 Dincbas, Van Hentenryck, Simonis, Aggoun, Graf, Berthier (BIB14) 1988 Menez, Barahona, Codognet (BIB35) 1993 Cousin (BIB13) 1993 Desroches, Laporte, Rousseau (BIB17) 1978; 16 Desroches, Laporte (BIB16) 1984 Baptiste, Legeard, Varnier (BIB5) 1992 Glover (BIB24) 1989; 1 Rueher (BIB38) 1993; 23 Rueher, Legeard (BIB37) 1992 Simonis, Cornelissens (BIB39) 1994 Van Hentenryck (BIB29) 1991 Bellone, Chamard, Pradelles (BIB3) 1992 Jourdan, Sola (BIB33) 1993 Le Pape, Ranson (BIB36) 1991 de Werra (BIB19) 1985; 19 Vi Cao, du Merle, Vial (BIB10) 1992; 1 Dincbas, Simonis, Van Hentenryck (BIB18) 1990; 8 Glover (BIB25) 1989; 2 Boizumault, Delon, Péridy (BIB4) 1994 Lim, Jourdan (BIB34) 1994 Rayward-Smith, Shing (BIB40) 1983; 19 Chamard, Fischler (BIB11) 1994 Dyckhoff (BIB21) 1990; 44 Harralick, Elliot (BIB27) 1980; 14 Diaz (BIB15) 1994 Borning, Maher, Martingale, Wilson (BIB6) 1989 Beldiceanu, Contejean (BIB2) 1994; 20 de Werra (BIB20) 1990; 7 Wood (BIB43) 1968 de Werra (10.1016/0743-1066(95)00100-X_BIB19) 1985; 19 Hertz (10.1016/0743-1066(95)00100-X_BIB26) 1987; 39 Van Hentenryck (10.1016/0743-1066(95)00100-X_BIB30) 1992 Van Hentenryck (10.1016/0743-1066(95)00100-X_BIB28) 1989 de Werra (10.1016/0743-1066(95)00100-X_BIB20) 1990; 7 Dincbas (10.1016/0743-1066(95)00100-X_BIB18) 1990; 8 Boizumault (10.1016/0743-1066(95)00100-X_BIB4) 1994 Boufflet (10.1016/0743-1066(95)00100-X_BIB7) 1994 Dincbas (10.1016/0743-1066(95)00100-X_BIB14) 1988 Rayward-Smith (10.1016/0743-1066(95)00100-X_BIB40) 1983; 19 Rueher (10.1016/0743-1066(95)00100-X_BIB37) 1992 Van Hentenryck (10.1016/0743-1066(95)00100-X_BIB29) 1991 Simonis (10.1016/0743-1066(95)00100-X_BIB39) 1994 Desroches (10.1016/0743-1066(95)00100-X_BIB16) 1984 Jourdan (10.1016/0743-1066(95)00100-X_BIB33) 1993 Baptiste (10.1016/0743-1066(95)00100-X_BIB5) 1992 Fages (10.1016/0743-1066(95)00100-X_BIB22) 1994 Van Hentenryck (10.1016/0743-1066(95)00100-X_BIB31) 1992 Le Pape (10.1016/0743-1066(95)00100-X_BIB36) 1991 Chamard (10.1016/0743-1066(95)00100-X_BIB11) 1994 Cousin (10.1016/0743-1066(95)00100-X_BIB13) 1993 Desroches (10.1016/0743-1066(95)00100-X_BIB17) 1978; 16 Tripathy (10.1016/0743-1066(95)00100-X_BIB41) 1984; 30 Feldman (10.1016/0743-1066(95)00100-X_BIB23) 1990; 33 Glover (10.1016/0743-1066(95)00100-X_BIB25) 1989; 2 Beldiceanu (10.1016/0743-1066(95)00100-X_BIB2) 1994; 20 Borning (10.1016/0743-1066(95)00100-X_BIB6) 1989 Jaffar (10.1016/0743-1066(95)00100-X_BIB32) 1994 (10.1016/0743-1066(95)00100-X_BIB12) 1993 Dyckhoff (10.1016/0743-1066(95)00100-X_BIB21) 1990; 44 Carter (10.1016/0743-1066(95)00100-X_BIB9) 1986; 34 Menez (10.1016/0743-1066(95)00100-X_BIB35) 1993 Tsang (10.1016/0743-1066(95)00100-X_BIB42) 1993 Lim (10.1016/0743-1066(95)00100-X_BIB34) 1994 Diaz (10.1016/0743-1066(95)00100-X_BIB15) 1994 Bellone (10.1016/0743-1066(95)00100-X_BIB3) 1992 Glover (10.1016/0743-1066(95)00100-X_BIB24) 1989; 1 Aggoun (10.1016/0743-1066(95)00100-X_BIB1) 1992 Barham (10.1016/0743-1066(95)00100-X_BIB8) 1978; 29 Wood (10.1016/0743-1066(95)00100-X_BIB43) 1968 Rueher (10.1016/0743-1066(95)00100-X_BIB38) 1993; 23 Harralick (10.1016/0743-1066(95)00100-X_BIB27) 1980; 14 Vi Cao (10.1016/0743-1066(95)00100-X_BIB10) 1992; 1 |
| References_xml | – year: 1989 ident: BIB6 article-title: Constraint Hierarchies and Logic Programming publication-title: Sixth International Logic Programming Conference – start-page: 351 year: 1984 end-page: 360 ident: BIB16 article-title: Examination Timetabling by Computer publication-title: Oper. Res. – volume: 23 start-page: 177 year: 1993 end-page: 200 ident: BIB38 article-title: A First Exploration of PrologIII's Capabilities publication-title: Software—Practice and Experience – year: 1994 ident: BIB39 article-title: Modelling Producer/Consumer Constraints publication-title: Workshop on Constraint Languages and Their use in Problem Modelling, ILPS'95 – volume: 1 start-page: 190 year: 1989 end-page: 206 ident: BIB24 article-title: Tabu Search: Part 1 publication-title: ORSA J. Comput. – year: 1992 ident: BIB30 article-title: Scheduling and Packing in the Constraint Language cc(FD) publication-title: Technical Report – year: 1991 ident: BIB36 article-title: Clef or Programming with Constraints, Logic, Equations and Functions publication-title: 4th International Conference on Software Engineering and its Applications – volume: 1 start-page: 377 year: 1992 end-page: 399 ident: BIB10 article-title: Un Système de Confection Automatisée d'Examens publication-title: Rev. Syst. de Décision – start-page: 503 year: 1994 end-page: 581 ident: BIB32 article-title: Constraint Logic Programming: A Survey publication-title: J. Logic Programming – year: 1993 ident: BIB33 article-title: The Versality of Handling Disjunctions as Constraints publication-title: PLIP'93 – year: 1992 ident: BIB3 article-title: Plane: An Evolutive System for Aircraft Production Written in Chip publication-title: First International Conference on Practical Applications of Prolog – volume: 14 start-page: 263 year: 1980 end-page: 313 ident: BIB27 article-title: Increasing Tree Search Efficiency for Constraint Satisfaction Problems publication-title: Artificial Intelligence – volume: 33 start-page: 356 year: 1990 end-page: 364 ident: BIB23 article-title: Optimization Algorithms for Student Scheduling via Constraint Satisfiability publication-title: Comput. J. – year: 1994 ident: BIB15 publication-title: Inria – volume: 2 start-page: 4 year: 1989 end-page: 32 ident: BIB25 article-title: Tabu Search: Part 2 publication-title: ORSA J. Comput. – year: 1989 ident: BIB28 article-title: Constraint Satisfaction in Logic Programming – start-page: 41 year: 1968 end-page: 47 ident: BIB43 article-title: A System for Computing University Examination Timetables publication-title: Comput. J. – volume: 19 start-page: 142 year: 1983 end-page: 146 ident: BIB40 article-title: Bin-Packing publication-title: Bulletin of the IMA – year: 1993 ident: BIB12 publication-title: Chip User's Guide – year: 1992 ident: BIB1 article-title: Extending Chip in Order to Solve Complex Scheduling and Placement Problems publication-title: Journées Francophones de la Programmation en logique – year: 1993 ident: BIB13 article-title: Applications de la Programmation en Logique avec Contraintes au Problème d'Emploi du Temps publication-title: Ph.D. thesis – volume: 44 start-page: 145 year: 1990 end-page: 159 ident: BIB21 article-title: A Typology of Cutting and Packing Problems publication-title: European J. Oper. Res. – year: 1994 ident: BIB4 article-title: Planning Exams Using Constraint Logic Programming publication-title: Second International Conference on Practical Applications of Prolog – year: 1993 ident: BIB42 article-title: Foundations of Constraint Satisfaction – volume: 20 start-page: 97 year: 1994 end-page: 123 ident: BIB2 article-title: Introducing Global Constraints in Chip publication-title: Math. Comput. Modelling – year: 1991 ident: BIB29 article-title: The Cardinality Operator: A New Logical Connective for Constraint Logic Programming publication-title: Eighth International Logic Programming Conference – year: 1993 ident: BIB35 article-title: An Incremental Constraint Solver Applied to a Time-Tabling Problem publication-title: Thirteenth Conference on Expert Systems – volume: 16 year: 1978 ident: BIB17 article-title: Horex: A Computer Program for the Construction of Examination Schedules publication-title: INFOR – volume: 8 start-page: 74 year: 1990 end-page: 94 ident: BIB18 article-title: Solving Large Combinatorial Problems in Logic Programming publication-title: J. Logic Programming – volume: 19 start-page: 151 year: 1985 end-page: 162 ident: BIB19 article-title: An Introduction to Time Tabling publication-title: European J. Oper. Res. – volume: 7 start-page: 191 year: 1990 end-page: 208 ident: BIB20 article-title: Heuristics for Graph Coloring publication-title: Comput. Suppl. – year: 1992 ident: BIB37 article-title: Which Role for CLP in Software Engineering? publication-title: An Investigation on the Basis of First Applications – volume: 34 start-page: 193 year: 1986 end-page: 202 ident: BIB9 article-title: A Survey of Practical Applications of Examination Timetabling Algorithms publication-title: Oper. Res. – year: 1992 ident: BIB31 article-title: Implementation and Evaluation of the Constraint Language cc(FD) publication-title: Technical Report – year: 1988 ident: BIB14 article-title: The Constraint Logic Programming Language Chip publication-title: International Conference on Fifth Generation Computer Systems – year: 1994 ident: BIB7 article-title: About Planning an Examination Session publication-title: ECCO VII – volume: 39 start-page: 345 year: 1987 end-page: 351 ident: BIB26 article-title: Using Tabu Search for Graph Coloring publication-title: Comput. – volume: 29 start-page: 1055 year: 1978 end-page: 1060 ident: BIB8 article-title: A Simple Heuristic to Facilitate Course TimeTabling publication-title: J. Oper. Res. Soc. – year: 1994 ident: BIB34 publication-title: Workshop on Constraint Languages and Their use in Problem Modelling – year: 1992 ident: BIB5 article-title: Hoist Scheduling Problem: An Approach Based on Constraint Programming publication-title: IEEE International Conference on Robotics and Automation – year: 1994 ident: BIB22 article-title: Handling Preferences in Constraint Logic Programming with Relationnal Optimization publication-title: PLIP'94 – volume: 30 start-page: 1473 year: 1984 end-page: 1489 ident: BIB41 article-title: School Timetabling: A Case in Large Binary Integer Linear Programming publication-title: Management Sci. – year: 1994 ident: BIB11 article-title: A Workshop Scheduler Written in Chip publication-title: Second International Conference on Practical Applications of Prolog – volume: 33 start-page: 356 issue: 4 year: 1990 ident: 10.1016/0743-1066(95)00100-X_BIB23 article-title: Optimization Algorithms for Student Scheduling via Constraint Satisfiability publication-title: Comput. J. doi: 10.1093/comjnl/33.4.356 – year: 1991 ident: 10.1016/0743-1066(95)00100-X_BIB29 article-title: The Cardinality Operator: A New Logical Connective for Constraint Logic Programming – volume: 2 start-page: 4 issue: 1 year: 1989 ident: 10.1016/0743-1066(95)00100-X_BIB25 article-title: Tabu Search: Part 2 publication-title: ORSA J. Comput. doi: 10.1287/ijoc.2.1.4 – year: 1989 ident: 10.1016/0743-1066(95)00100-X_BIB28 – start-page: 351 year: 1984 ident: 10.1016/0743-1066(95)00100-X_BIB16 article-title: Examination Timetabling by Computer publication-title: Oper. Res. – volume: 39 start-page: 345 year: 1987 ident: 10.1016/0743-1066(95)00100-X_BIB26 article-title: Using Tabu Search for Graph Coloring publication-title: Comput. doi: 10.1007/BF02239976 – year: 1992 ident: 10.1016/0743-1066(95)00100-X_BIB5 article-title: Hoist Scheduling Problem: An Approach Based on Constraint Programming – year: 1993 ident: 10.1016/0743-1066(95)00100-X_BIB42 – volume: 19 start-page: 151 year: 1985 ident: 10.1016/0743-1066(95)00100-X_BIB19 article-title: An Introduction to Time Tabling publication-title: European J. Oper. Res. doi: 10.1016/0377-2217(85)90167-5 – volume: 30 start-page: 1473 issue: 12 year: 1984 ident: 10.1016/0743-1066(95)00100-X_BIB41 article-title: School Timetabling: A Case in Large Binary Integer Linear Programming publication-title: Management Sci. doi: 10.1287/mnsc.30.12.1473 – year: 1993 ident: 10.1016/0743-1066(95)00100-X_BIB33 article-title: The Versality of Handling Disjunctions as Constraints publication-title: PLIP'93 – year: 1994 ident: 10.1016/0743-1066(95)00100-X_BIB22 article-title: Handling Preferences in Constraint Logic Programming with Relationnal Optimization publication-title: PLIP'94 – year: 1991 ident: 10.1016/0743-1066(95)00100-X_BIB36 article-title: Clef or Programming with Constraints, Logic, Equations and Functions – start-page: 503 year: 1994 ident: 10.1016/0743-1066(95)00100-X_BIB32 article-title: Constraint Logic Programming: A Survey publication-title: J. Logic Programming doi: 10.1016/0743-1066(94)90033-7 – volume: 29 start-page: 1055 year: 1978 ident: 10.1016/0743-1066(95)00100-X_BIB8 article-title: A Simple Heuristic to Facilitate Course TimeTabling publication-title: J. Oper. Res. Soc. doi: 10.1057/jors.1978.237 – volume: 16 year: 1978 ident: 10.1016/0743-1066(95)00100-X_BIB17 article-title: Horex: A Computer Program for the Construction of Examination Schedules publication-title: INFOR – year: 1992 ident: 10.1016/0743-1066(95)00100-X_BIB31 article-title: Implementation and Evaluation of the Constraint Language cc(FD) doi: 10.1016/S0743-1066(98)10006-7 – year: 1992 ident: 10.1016/0743-1066(95)00100-X_BIB1 article-title: Extending Chip in Order to Solve Complex Scheduling and Placement Problems publication-title: Journées Francophones de la Programmation en logique – year: 1992 ident: 10.1016/0743-1066(95)00100-X_BIB37 article-title: Which Role for CLP in Software Engineering? – year: 1989 ident: 10.1016/0743-1066(95)00100-X_BIB6 article-title: Constraint Hierarchies and Logic Programming – volume: 8 start-page: 74 issue: 1–2 year: 1990 ident: 10.1016/0743-1066(95)00100-X_BIB18 article-title: Solving Large Combinatorial Problems in Logic Programming publication-title: J. Logic Programming – volume: 34 start-page: 193 year: 1986 ident: 10.1016/0743-1066(95)00100-X_BIB9 article-title: A Survey of Practical Applications of Examination Timetabling Algorithms publication-title: Oper. Res. doi: 10.1287/opre.34.2.193 – year: 1993 ident: 10.1016/0743-1066(95)00100-X_BIB12 – year: 1988 ident: 10.1016/0743-1066(95)00100-X_BIB14 article-title: The Constraint Logic Programming Language Chip – year: 1994 ident: 10.1016/0743-1066(95)00100-X_BIB7 article-title: About Planning an Examination Session publication-title: ECCO VII – year: 1993 ident: 10.1016/0743-1066(95)00100-X_BIB35 article-title: An Incremental Constraint Solver Applied to a Time-Tabling Problem – volume: 1 start-page: 377 issue: 4 year: 1992 ident: 10.1016/0743-1066(95)00100-X_BIB10 article-title: Un Système de Confection Automatisée d'Examens publication-title: Rev. Syst. de Décision – year: 1992 ident: 10.1016/0743-1066(95)00100-X_BIB3 article-title: Plane: An Evolutive System for Aircraft Production Written in Chip – year: 1994 ident: 10.1016/0743-1066(95)00100-X_BIB15 article-title: clp(fd) User's Manual – volume: 23 start-page: 177 issue: 2 year: 1993 ident: 10.1016/0743-1066(95)00100-X_BIB38 article-title: A First Exploration of PrologIII's Capabilities publication-title: Software—Practice and Experience doi: 10.1002/spe.4380230204 – year: 1994 ident: 10.1016/0743-1066(95)00100-X_BIB11 article-title: A Workshop Scheduler Written in Chip – year: 1993 ident: 10.1016/0743-1066(95)00100-X_BIB13 article-title: Applications de la Programmation en Logique avec Contraintes au Problème d'Emploi du Temps – volume: 19 start-page: 142 year: 1983 ident: 10.1016/0743-1066(95)00100-X_BIB40 article-title: Bin-Packing publication-title: Bulletin of the IMA – volume: 44 start-page: 145 year: 1990 ident: 10.1016/0743-1066(95)00100-X_BIB21 article-title: A Typology of Cutting and Packing Problems publication-title: European J. Oper. Res. doi: 10.1016/0377-2217(90)90350-K – year: 1992 ident: 10.1016/0743-1066(95)00100-X_BIB30 article-title: Scheduling and Packing in the Constraint Language cc(FD) – volume: 20 start-page: 97 year: 1994 ident: 10.1016/0743-1066(95)00100-X_BIB2 article-title: Introducing Global Constraints in Chip publication-title: Math. Comput. Modelling doi: 10.1016/0895-7177(94)90127-9 – start-page: 41 year: 1968 ident: 10.1016/0743-1066(95)00100-X_BIB43 article-title: A System for Computing University Examination Timetables publication-title: Comput. J. doi: 10.1093/comjnl/11.1.41 – year: 1994 ident: 10.1016/0743-1066(95)00100-X_BIB34 – volume: 14 start-page: 263 year: 1980 ident: 10.1016/0743-1066(95)00100-X_BIB27 article-title: Increasing Tree Search Efficiency for Constraint Satisfaction Problems publication-title: Artificial Intelligence doi: 10.1016/0004-3702(80)90051-X – year: 1994 ident: 10.1016/0743-1066(95)00100-X_BIB39 article-title: Modelling Producer/Consumer Constraints – year: 1994 ident: 10.1016/0743-1066(95)00100-X_BIB4 article-title: Planning Exams Using Constraint Logic Programming – volume: 7 start-page: 191 year: 1990 ident: 10.1016/0743-1066(95)00100-X_BIB20 article-title: Heuristics for Graph Coloring publication-title: Comput. Suppl. doi: 10.1007/978-3-7091-9076-0_10 – volume: 1 start-page: 190 issue: 3 year: 1989 ident: 10.1016/0743-1066(95)00100-X_BIB24 article-title: Tabu Search: Part 1 publication-title: ORSA J. Comput. doi: 10.1287/ijoc.1.3.190 |
| SSID | ssj0001115 |
| Score | 1.3228999 |
| Snippet | In this paper, we present an application of constraint logic programming to the examination timetabling problem of our university. Each year, in June, 4000... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 217 |
| Title | Constraint logic programming for examination timetabling |
| URI | https://dx.doi.org/10.1016/0743-1066(95)00100-X |
| Volume | 26 |
| WOSCitedRecordID | wos074310669500100X&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-5789 dateEnd: 20001231 omitProxy: false ssIdentifier: ssj0001115 issn: 0743-1066 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3NS-QwFA_u6GEvfu7iNz0oKEvYTmbSJEfxAxURDyq9laSTgDJTRTsy-Nf70iZp_cBdD15CG5rXpr_Hey_J-0BoS4HJoamkmCglcV9Ig5XIBVbWs2nAjTbVfsf1GTs_52kqLlwIwWNVToAVBZ9MxP23Qg19ALYNnf0C3IEodMA1gA4twA7tfwFvS3BWhR_KP5Vc8y5YI-8zqSfS-r9UwNvS8qVUQ6_AbhvmaeWUeEcnLOLvbp7HIzkelq9CxQ60O8xvTqhg5rU4P2v2GdquyUEcVclM47pGipeddbS74xHyShCylk4ldbKLd-K63jkIlMGmFnSbCLtQjXHaqCh_LP9GcwV_Qu-qZillllImaFZRydIfaJowKngHTe-dHKanQU-DlKchSSuM8YGV3eRv6NsRdNd9zceGS8sYuZxHs24VEe3V6C-gKV0sojlfoSNyAnsJ8YYZogrEqAViBMwQtZghajHDL3R1dHi5f4xdrQyc9-J-ia3lSxOWJELHBmz0vGs004LzHOxxTYzQkkvdowba_kAmCdxSDksr1hUqGfDeb9Qp7gq9jKKYGsmVMEoNRJ8wpZIuCHVKYilNzki-gnr-R2S5SyRvZzLMPoNhBeEw6r5OpPKP55n_x5kzBmsjLwPm-XTk6hfftIZ-Nvy-jjrlw1hvoJn8qbx5fNh0XPMCh996tg |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Constraint+logic+programming+for+examination+timetabling&rft.jtitle=The+journal+of+logic+programming&rft.au=Boizumault%2C+P&rft.au=Delon%2C+Y&rft.au=Peridy%2C+L&rft.date=1996-02-01&rft.issn=0743-1066&rft.volume=26&rft.issue=2&rft.spage=217&rft.epage=233&rft_id=info:doi/10.1016%2F0743-1066%2895%2900100-X&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_0743_1066_95_00100_X |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-1066&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-1066&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-1066&client=summon |