Scheduling, limited capacity and constraint logic programming
Solving scheduling problems with constraint logic programming has been a well studied subject in research projects over the last few years. The emphasis has been put on how to model and solve scheduling problems in CLP. The main contribution of this paper is the generalization of the notion of limit...
Gespeichert in:
| Veröffentlicht in: | 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation : proceedings, ETFA '95, Paris, France, October 10-13, 1995 Jg. 2; S. 177 - 186 vol.2 |
|---|---|
| 1. Verfasser: | |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
Los Alamitos CA
IEEE
1995
IEEE Computer Society Press |
| Schlagworte: | |
| ISBN: | 9780780325357, 0780325354 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Solving scheduling problems with constraint logic programming has been a well studied subject in research projects over the last few years. The emphasis has been put on how to model and solve scheduling problems in CLP. The main contribution of this paper is the generalization of the notion of limited capacity in the context of scheduling. In former approaches, resources were assumed to offer a capacity of one unit, and no choice among different resources was possible, or only one resource with a capacity greater than one was considered. The author proposes a more abstract view of resources called abstract resource groups, ARGs, allowing one to model and solve resource group planning problems. An algorithm to decompose scheduling problems on ARGs into independent subproblems is presented. The author describes a translation of the constraints used to model scheduling problems into CLP with emphasis on the capacity conditions. Finally, the author briefly reports his experiences with the application of a system based on this approach to a large sized industrial scheduling problem. |
|---|---|
| AbstractList | Solving scheduling problems with constraint logic programming has been a well studied subject in research projects over the last few years. The emphasis has been put on how to model and solve scheduling problems in CLP. The main contribution of this paper is the generalization of the notion of limited capacity in the context of scheduling. In former approaches, resources were assumed to offer a capacity of one unit, and no choice among different resources was possible, or only one resource with a capacity greater than one was considered. The author proposes a more abstract view of resources called abstract resource groups, ARGs, allowing one to model and solve resource group planning problems. An algorithm to decompose scheduling problems on ARGs into independent subproblems is presented. The author describes a translation of the constraints used to model scheduling problems into CLP with emphasis on the capacity conditions. Finally, the author briefly reports his experiences with the application of a system based on this approach to a large sized industrial scheduling problem. |
| Author | Petith, H. |
| Author_xml | – sequence: 1 givenname: H. surname: Petith fullname: Petith, H. organization: Sci. Centre, IBM Deutschland Informationssyst. GmbH, Heidelberg, Germany |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=3266124$$DView record in Pascal Francis |
| BookMark | eNo9kL1LxEAQxRdUUM_0YpXC0sTNfmYLi-O4U-HAwvTH7FdcSTZhE4v77w1EHAaGH_PeK94tuoxDdAjdV7isKqye981hW1ZK8ZIpIbi8QJmSNV6WEk65vEbZNH3jZRhfGN-gl0_z5exPF2L7lHehD7OzuYERTJjPOcQFhjjNCUKc825og8nHNLQJ-n6x3KErD93ksr-7Qc1h3-zeiuPH6_tueywCq1lhnZe4BmJ1pUEAqamXghmnMSNKMY8NJVoT6Y1m3GmJiagtdlpxrazRlG7Q4xo7wmSg8wmiCdNpTKGHdD5RIkRF2CJ7WGXBOff_XZugvzCvVd8 |
| ContentType | Conference Proceeding |
| Copyright | 1996 INIST-CNRS |
| Copyright_xml | – notice: 1996 INIST-CNRS |
| DBID | 6IE 6IL CBEJK RIE RIL IQODW |
| DOI | 10.1109/ETFA.1995.496657 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEL IEEE Proceedings Order Plans (POP All) 1998-Present Pascal-Francis |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Applied Sciences |
| EndPage | 186 vol.2 |
| ExternalDocumentID | 3266124 496657 |
| GroupedDBID | 6IE 6IK 6IL AAJGR AAWTH ACGHX ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK OCL RIE RIL IQODW |
| ID | FETCH-LOGICAL-i484-def708a2db1ba6a283f764ceb042994f0c32bb27fcb45eb70268d0eb95b9dcb33 |
| IEDL.DBID | RIE |
| ISBN | 9780780325357 0780325354 |
| IngestDate | Wed Apr 02 07:35:17 EDT 2025 Tue Aug 26 21:41:07 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Keywords | Scheduling Logical programming Heuristic approach |
| Language | English |
| License | CC BY 4.0 |
| LinkModel | DirectLink |
| MeetingName | ETFA '95 : 1995 INRIA/IEEE symposium on emerging technologies and factory automation |
| MergedId | FETCHMERGED-LOGICAL-i484-def708a2db1ba6a283f764ceb042994f0c32bb27fcb45eb70268d0eb95b9dcb33 |
| PageCount | 10 |
| ParticipantIDs | pascalfrancis_primary_3266124 ieee_primary_496657 |
| PublicationCentury | 1900 |
| PublicationDate | 19950000 1995 |
| PublicationDateYYYYMMDD | 1995-01-01 |
| PublicationDate_xml | – year: 1995 text: 19950000 |
| PublicationDecade | 1990 |
| PublicationPlace | Los Alamitos CA |
| PublicationPlace_xml | – name: Los Alamitos CA |
| PublicationTitle | 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation : proceedings, ETFA '95, Paris, France, October 10-13, 1995 |
| PublicationTitleAbbrev | ETFA |
| PublicationYear | 1995 |
| Publisher | IEEE IEEE Computer Society Press |
| Publisher_xml | – name: IEEE – name: IEEE Computer Society Press |
| SSID | ssj0000455350 |
| Score | 1.2353722 |
| Snippet | Solving scheduling problems with constraint logic programming has been a well studied subject in research projects over the last few years. The emphasis has... |
| SourceID | pascalfrancis ieee |
| SourceType | Index Database Publisher |
| StartPage | 177 |
| SubjectTerms | Applied sciences Capacity planning Clocks Exact sciences and technology Job shop scheduling Labeling Logic programming Mathematical model Operational research and scientific management Operational research. Management science Prototypes Scheduling algorithm Scheduling, sequencing |
| Title | Scheduling, limited capacity and constraint logic programming |
| URI | https://ieeexplore.ieee.org/document/496657 |
| Volume | 2 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELZoxcDEq4gCRR4Yces6dmwPDAg1Yqoq0aFbZTtnVAlS1Ae_H9tJC0gsbDlFtuKzlPvu8d0hdMc8ZNp7RkqlFeHOeKLMUBMjgObURZjv07AJOR6r2UxPmj7biQsDAKn4DPrxMeXyy6XbxlDZgOuYJ2ihlpR5TdXah1MCMhGZoMkxVzRjQeBNf52dLHdZSqoHo2nxGIl6ol_v2cxWiZWRZh2U4-upFj9MTXH8r488QZ1vyh6e7I3RKTqA6hw9vIQrKWOt-es9fqupTNgF8-gC9samCkKEh3FKxAannyBu6rXew5IOmhaj6dMzaeYlkAVXnJTgJVWGlXZoTW4CbvAy5w5ssjncU5cxa5n0znIBVgbvS5UUrBZWl85m2QVqV8sKLhEO-3gJlNlh7niw4cEpc8qDASlYULTsorN48PlH3RFjXp-5i3q_tLd_nUUUwPjVn6uu0VFNE49hjRvU3qy20EOH7nOzWK9u0y1_AdkKpaY |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFA86BT35NXHqtAePZsvStEkOHkQ2Js4xsIfdRpK-yEA72Yd_v0naTQUv3vooCc0L9P3e5w-hG2ohltZSnAspMDPKYqE6EqsESEqMh_k2kE3w4VCMx3JUzdkOvTAAEIrPoOUfQy4_n5mVD5W1mfR5gm2044mzqmatTUDFYZMkTkhwzQWJqRNYNWFnLfN1npLIdjfr3ftWvaRV7lqxq_jaSLVw6rElr8UPY9M7-NdnHqL6d9NeNNqYoyO0BcUJuntxl5L7avPX2-itbGaKjDOQxqHvSBVO8ADR80Qso_AbjKqKrXe3pI6yXjd76OOKMQFPmWA4B8uJUDTXHa1S5ZCD5SkzoIPVYZaYmGpNuTWaJaC5879ETkDLRMvc6Dg-RbViVsAZitw-lgOhupMa5qy4c8uMsKCAJ9QpmjfQsT_45KOciTEpz9xAzV_a27yOPQ6g7PzPVddor589DyaDx-HTBdovm8Z9kOMS1ZbzFTTRrvlcThfzq3DjX6uUqO8 |
| 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%3Abook&rft.genre=proceeding&rft.title=1995+INRIA%2FIEEE+Symposium+on+Emerging+Technologies+and+Factory+Automation+%3A+proceedings%2C+ETFA+%2795%2C+Paris%2C+France%2C+October+10-13%2C+1995&rft.atitle=Scheduling%2C+limited+capacity+and+constraint+logic+programming&rft.au=PETITH%2C+H&rft.date=1995-01-01&rft.pub=IEEE+Computer+Society+Press&rft.isbn=9780780325357&rft.spage=177&rft.epage=186&rft_id=info:doi/10.1109%2FETFA.1995.496657&rft.externalDBID=n%2Fa&rft.externalDocID=3266124 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780325357/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780325357/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780325357/sc.gif&client=summon&freeimage=true |