A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays
We investigate a single-machine scheduling problem with precedence delays that have a simple structure: the corresponding tree has k leaves and only k+2 nodes. The objective is to minimize the makespan. We present a pseudo-polynomial algorithm for this problem, and we also give a fully polynomial ap...
Saved in:
| Published in | Operations research letters Vol. 23; no. 1; pp. 9 - 11 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Amsterdam
Elsevier B.V
01.08.1998
Elsevier |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0167-6377 1872-7468 |
| DOI | 10.1016/S0167-6377(98)00012-1 |
Cover
| Abstract | We investigate a single-machine scheduling problem with precedence delays that have a simple structure: the corresponding tree has
k leaves and only
k+2 nodes. The objective is to minimize the makespan. We present a pseudo-polynomial algorithm for this problem, and we also give a fully polynomial approximation scheme. |
|---|---|
| AbstractList | We investigate a single-machine scheduling problem with precedence delays that have a simple structure: the corresponding tree has
k leaves and only
k+2 nodes. The objective is to minimize the makespan. We present a pseudo-polynomial algorithm for this problem, and we also give a fully polynomial approximation scheme. |
| Author | Schuurman, Petra |
| Author_xml | – sequence: 1 givenname: Petra surname: Schuurman fullname: Schuurman, Petra organization: Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O.Box 513, 5600 MB Eindhoven, The Netherlands |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1794543$$DView record in Pascal Francis |
| BookMark | eNqFkL1OwzAUhS1UJErhEZA8MMAQsOMkdsSAqoo_qRIDMFvGuaZGbhLZKZC3x0lRB5YuvrLuOcc-3zGa1E0NCJ1RckUJLa5f4sGTgnF-UYpLQghNE3qAplTwNOFZISZoupMcoeMQPqOICyqmSM-x2TjX47Zxfd2srXJYta1vfuxadbapcdArWAM2jcdqvFQbZ-sPHDXvDtb423YrbOvOAyRd30JcgIYKag24Aqf6cIIOjXIBTv_mDL3d370uHpPl88PTYr5MNGNFl6RKiZQZRhjPFY2_g7JgVJRUp0ByFVtVRGUpr3he5iZLFQUomREmrUquKWUzdL7NbVXQyhmvam2DbH2s4ntJeZnlGYuym61M-yYED0Zq241dO6-sk5TIAascscqBmSyFHLHK4ZH8n3uXv8d3u_VBJPBlwcug7QCpspFXJ6vG7kn4BdOaklE |
| CODEN | ORLED5 |
| CitedBy_id | crossref_primary_10_1137_S0097539799358094 crossref_primary_10_1038_s41598_022_13278_y crossref_primary_10_1016_j_orl_2003_12_003 |
| Cites_doi | 10.1016/0167-6377(94)90064-7 |
| ContentType | Journal Article |
| Copyright | 1998 Elsevier Science B.V. 1999 INIST-CNRS |
| Copyright_xml | – notice: 1998 Elsevier Science B.V. – notice: 1999 INIST-CNRS |
| DBID | AAYXX CITATION IQODW |
| DOI | 10.1016/S0167-6377(98)00012-1 |
| DatabaseName | CrossRef Pascal-Francis |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Sciences (General) Applied Sciences |
| EISSN | 1872-7468 |
| EndPage | 11 |
| ExternalDocumentID | 1794543 10_1016_S0167_6377_98_00012_1 S0167637798000121 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1OL 1RT 1~. 1~5 29N 4.4 457 4G. 4R4 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO ABAOU ABFNM ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNCT ACRLP ADBBV ADEZE ADGUI ADIYS ADMUD AEBSH AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA HAMUX HVGLF HZ~ IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SDF SDG SDS SES SEW SPC SPCBC SSB SSD SSW SSZ T5K TN5 WH7 WUQ XPP XSW ~G- AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH |
| ID | FETCH-LOGICAL-c336t-2aa823f30375a1818e9631891c2e05a012d0a427d7595f42a1ee93f8f2d97c113 |
| IEDL.DBID | AIKHN |
| ISSN | 0167-6377 |
| IngestDate | Mon Jul 21 09:15:34 EDT 2025 Wed Oct 01 01:58:00 EDT 2025 Thu Apr 24 22:59:44 EDT 2025 Fri Feb 23 02:20:42 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Precedence constraints Minimum delays Scheduling Minimum time Approximate method Makespan Precedence constraint Delay Polynomial time |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c336t-2aa823f30375a1818e9631891c2e05a012d0a427d7595f42a1ee93f8f2d97c113 |
| PageCount | 3 |
| ParticipantIDs | pascalfrancis_primary_1794543 crossref_citationtrail_10_1016_S0167_6377_98_00012_1 crossref_primary_10_1016_S0167_6377_98_00012_1 elsevier_sciencedirect_doi_10_1016_S0167_6377_98_00012_1 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 1900 |
| PublicationDate | 1998-08-01 |
| PublicationDateYYYYMMDD | 1998-08-01 |
| PublicationDate_xml | – month: 08 year: 1998 text: 1998-08-01 day: 01 |
| PublicationDecade | 1990 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationTitle | Operations research letters |
| PublicationYear | 1998 |
| Publisher | Elsevier B.V Elsevier |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier |
| References | Wikum, Llewellyn, Nemhauser (BIB1) 1994; 16 Wikum (10.1016/S0167-6377(98)00012-1_BIB1) 1994; 16 |
| References_xml | – volume: 16 start-page: 87 year: 1994 end-page: 99 ident: BIB1 article-title: One-machine generalized precedence constrained scheduling publication-title: Oper. Res. Lett. – volume: 16 start-page: 87 year: 1994 ident: 10.1016/S0167-6377(98)00012-1_BIB1 article-title: One-machine generalized precedence constrained scheduling publication-title: Oper. Res. Lett. doi: 10.1016/0167-6377(94)90064-7 |
| SSID | ssj0007818 |
| Score | 1.5077038 |
| Snippet | We investigate a single-machine scheduling problem with precedence delays that have a simple structure: the corresponding tree has
k leaves and only
k+2 nodes.... |
| SourceID | pascalfrancis crossref elsevier |
| SourceType | Index Database Enrichment Source Publisher |
| StartPage | 9 |
| SubjectTerms | Applied sciences Exact sciences and technology Minimum delays Operational research and scientific management Operational research. Management science Precedence constraints Scheduling Scheduling, sequencing |
| Title | A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays |
| URI | https://dx.doi.org/10.1016/S0167-6377(98)00012-1 |
| Volume | 23 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier Complete Freedom Collection customDbUrl: eissn: 1872-7468 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0007818 issn: 0167-6377 databaseCode: ACRLP dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals customDbUrl: eissn: 1872-7468 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0007818 issn: 0167-6377 databaseCode: AIKHN dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect (Elsevier) customDbUrl: eissn: 1872-7468 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0007818 issn: 0167-6377 databaseCode: .~1 dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1872-7468 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0007818 issn: 0167-6377 databaseCode: AKRWK dateStart: 19811001 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8MwDLZgu4AQ4ileQzlw2A7dliZt0-OEmAaIXWDSblUfCZo0tooNiV347dhtNsYBTeLYtHnITmzHtT8D3MhAoBaWbceVWeBIzQ0eKY2PnAslE7J5KVH4qe_3BvJh6A234HaZC0NhlVb2lzK9kNa2pWWp2cpHo9YzBdD7hJenCncKXoGqqH-UqkC1c__Y668EcqAKN18B8U0dfhJ5ykGKxnqoGsU4Dv9LRe3l8QwJZ8qKF2tqqHsA-9Z-ZJ1yiYewpSdHsLuGKngEh_a8zljdgko3jiHtMPK0L1g-HS8oFRkHKfDEP0dl8iLDa65-0wyNWBYXDxkFqb8yW3KGkceWjQgGUzvkuMUXGslHMzGCmlzMTmDQvXu57Tm2wIKTCuHPHTeOlSuMoDq4Map6pfE4chXy1NVtL0ZiZO1YukEWeKFnpBtzrUNhlHGzMEiRm6dQmUwn-gyYyNBY4_gNmocy80yijUlUqtoZLiXk6hzkkqZRatHHqQjGOFoLM_ODiFgRhar8Jx7xc2iuuuUl_MamDmrJsOjXPopQRWzqWvvF4J8JUWZ5Ulz8f-hL2ClzGSlw8Aoq8_cPXUNjZp5cw3bzi1_bLfsN0yTsew |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LTwIxEG4IHtQYI6gRFe3BAxwW6LbLdo-ESFCBi5Bw2yy7rSFBIIKJXPztznSLwMGQeGy3r8y0nenszDeEPAifgxQWNccVie8IxTQcKQVFxrgUI9R5MVC426u3B-J56A0zpLmOhUG3Snv3p3e6ua1tTdVSszofj6uv6EBfR7w8acwp8AQ6EJ7r4wus8r3x8_ClMfIZgG9svgnjSYcwlaVAls0oDvtLQJ3MowWQTaf5LraEUOuMnFrtkTbSBeZIRk3z5HgLUzBPcva0LmjJQkqXz0ncoGhnX9H5bLLCQGQYxKCJf43T0EUKj1z1riiosDQyhQRd1N-oTThD0V5LxwiCqRw028IHBcTDmSgCTa4WF2TQeuw3245Nr-DEnNeXjhtF0uWaYxbcCAS9VHAYmQxY7KqaFwExklokXD_xvcDTwo2YUgHXUrtJ4MfAy0uSnc6m6opQnoCqxqANKIci8fRIaT2SsawlsJSAyQIRa5qGscUexxQYk3DLyazuh8iKMJDpH_GQFUjlt9s8Bd_Y10GuGRbu7KIQBMS-rsUdBm8mhBvLE_z6_0Pfk8N2v9sJO0-9lxtylEY1ogvhLckuPz5VEdSa5ejObNsfvxLtQw |
| 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=A+fully+polynomial+approximation+scheme+for+a+scheduling+problem+with+intree-type+precedence+delays&rft.jtitle=Operations+research+letters&rft.au=Schuurman%2C+Petra&rft.date=1998-08-01&rft.issn=0167-6377&rft.volume=23&rft.issue=1-2&rft.spage=9&rft.epage=11&rft_id=info:doi/10.1016%2FS0167-6377%2898%2900012-1&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_S0167_6377_98_00012_1 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-6377&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-6377&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-6377&client=summon |