The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Extending chip in order to solve complex scheduling and placement problems
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
(1979) · Cited by 43,841
Glover, F., & Laguna, M. (1997) · Cited by 5,679
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Introduction to Sequencing and Scheduling
Clewett, A. J., & Baker, K. R. (1977) · Operational Research Quarterly (1970-1977) · doi:10.2307/3009192 · Cited by 2,597
The design and analysis of spatial data structures
Samet, H. (1989) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,380
Jaffar, J., & Lassez, J.-L. (1987) · Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '87 · doi:10.1145/41625.41635 · Cited by 1,597
Constraint satisfaction in logic programming
Hentenryck, P. V. (1989) · Medical Entomology and Zoology · Cited by 1,218
The Constraint Logic Programming Language CHIP.
Dincbas, M., Hentenryck, P. V., Simonis, H., Aggoun, A., Graf, T., & Berthier, F. (1988) · Future Generation Computer Systems · Cited by 508
Self-citationMachine Scheduling Problems: Classification, complexity and computations
Kan, R. (1976) · Medical Entomology and Zoology · Cited by 478
Cited by
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Principles of Constraint Programming
Apt, K. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511615320 · Cited by 888
The job shop scheduling problem: Conventional and new solution techniques
Błażewicz, J., Domschke, W., & Pesch, E. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(95)00362-2 · Cited by 536
Introducing global constraints in CHIP
Beldiceanu, N., & Contejean, E. (1994) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(94)90127-9 · Cited by 315
Self-citation
Metadata
- Authors
- Aggoun, A., & Beldiceanu, N.
- Venue
- Mathematical and Computer Modelling
- Publisher
- Elsevier BV
- Published
- 1993-04
- Volume
- 17
- Issue
- 7
- Pages
- 57-73
- ISSN
- 0895-7177 (ISSN-L)
- OpenAlex
- W2027140251
- Cited by
- 304
- References
- 15
- FWCI
- 12.23
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Extending chip in order to solve complex scheduling and placement problems. https://app.cochat.ai/papers/10.1016/0895-7177(93)90068-a
- The paper
- Aggoun, A., & Beldiceanu, N. (1993). Extending chip in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling. https://doi.org/10.1016/0895-7177(93)90068-a
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.