Complexity of single machine scheduling subject to nonnegative inventory constraints
This paper focuses on single machine scheduling subject to inventory constraints. Jobs either add items to an inventory or remove items from that inventory. Jobs that have to remove items cannot be processed if the required number of items is not available. We consider scheduling problems on a singl...
Uloženo v:
| Vydáno v: | European journal of operational research Ročník 207; číslo 2; s. 605 - 619 |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Amsterdam
Elsevier B.V
01.12.2010
Elsevier Elsevier Sequoia S.A |
| Edice: | European Journal of Operational Research |
| Témata: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | This paper focuses on single machine scheduling subject to inventory constraints. Jobs either add items to an inventory or remove items from that inventory. Jobs that have to remove items cannot be processed if the required number of items is not available. We consider scheduling problems on a single machine with the minimization of the total weighted completion time, the maximum lateness, and the number of tardy jobs, respectively, as objective and determine their computational complexity. Since the general versions of our problems turn out to be strongly NP-hard, we consider special cases by assuming that different jobs have certain parameter values in common. We determine the computational complexity for all special cases when the objective is either to minimize total completion time or to minimize maximum lateness and for several special cases when the objective is either to minimize total weighted completion time or to minimize the number of tardy jobs. |
|---|---|
| AbstractList | This paper focuses on single machine scheduling subject to inventory constraints. Jobs either add items to an inventory or remove items from that inventory. Jobs that have to remove items cannot be processed if the required number of items is not available. We consider scheduling problems on a single machine with the minimization of the total weighted completion time, the maximum lateness, and the number of tardy jobs, respectively, as objective and determine their computational complexity. Since the general versions of our problems turn out to be strongly NP-hard, we consider special cases by assuming that different jobs have certain parameter values in common. We determine the computational complexity for all special cases when the objective is either to minimize total completion time or to minimize maximum lateness and for several special cases when the objective is either to minimize total weighted completion time or to minimize the number of tardy jobs. This paper focuses on single machine scheduling subject to inventory constraints. Jobs either add items to an inventory or remove items from that inventory. Jobs that have to remove items cannot be processed if the required number of items is not available. We consider scheduling problems on a single machine with the minimization of the total weighted completion time, the maximum lateness, and the number of tardy jobs, respectively, as objective and determine their computational complexity. Since the general versions of our problems turn out to be strongly NP-hard, we consider special cases by assuming that different jobs have certain parameter values in common. We determine the computational complexity for all special cases when the objective is either to minimize total completion time or to minimize maximum lateness and for several special cases when the objective is either to minimize total weighted completion time or to minimize the number of tardy jobs. [PUBLICATION ABSTRACT] |
| Author | Choi, Byung-Cheon Pinedo, Michael Leung, Joseph Briskorn, Dirk Lee, Kangbok |
| Author_xml | – sequence: 1 givenname: Dirk surname: Briskorn fullname: Briskorn, Dirk email: briskorn@wiso.uni-koeln.de organization: Universität zu Köln, Wirtschafts- und Sozialwissenschaftliche Fakultät, Albertus-Magnus-Platz, 50923 Köln, Germany – sequence: 2 givenname: Byung-Cheon surname: Choi fullname: Choi, Byung-Cheon email: polytime@cnu.ac.kr organization: Department of Business Administration, Chungnam National University, 79 Daehangno, Yuseong-gu, Daejeon 305-704, South Korea – sequence: 3 givenname: Kangbok surname: Lee fullname: Lee, Kangbok email: klee3@stern.nyu.edu organization: Stern School of Business, New York University, 44 West 4th Street, New York, NY 10012, USA – sequence: 4 givenname: Joseph surname: Leung fullname: Leung, Joseph email: leung@cis.njit.edu organization: Department of Computer Science, New Jersey Institute of Technology, University Heights, Newark, NJ 07102, USA – sequence: 5 givenname: Michael surname: Pinedo fullname: Pinedo, Michael email: mpinedo@stern.nyu.edu organization: Stern School of Business, New York University, 44 West 4th Street, New York, NY 10012, USA |
| BackLink | http://www.econis.eu/PPNSET?PPN=635289539$$DView this record in ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23117427$$DView record in Pascal Francis http://econpapers.repec.org/article/eeeejores/v_3a207_3ay_3a2010_3ai_3a2_3ap_3a605-619.htm$$DView record in RePEc |
| BookMark | eNp9UsFq3DAQFSWFbtL-QC81hdKTt5K8kmzopSxtUhroJT0LWR5nZWzJlbRL9u87zi6h5BDBaIbhzczTPF2SCx88EPKe0TWjTH4Z1jCEuOYUE1SsaSVfkRWrFS9lLekFWdFKqZJzpt6Qy5QGSikTTKzI3TZM8wgPLh-L0BfJ-fsRisnYnfNQJLuDbj9iskj7dgCbixwKnO3h3mR3gML5A_gc4rGwwaccjfM5vSWvezMmeHf2V-TPj-9325vy9vf1z-2329IKxnPZKtZD1bZtpxhTlhmpmsbWFWOWbSg0olLNRklBjQQQvaSsq5F321La21b11RX5fOo7x_B3DynrySUL42g8hH3SSlLOaFM1iPz4DDmEffRITquNaATOUwj6dQJFmMHqObrJxKMGPLhcSPqgK8Opwvv4GDGKzi0h2owmqdCSNXqXJ-z26TzSJGvGPhpvXXrqyvGZasOXqR9OOMAN_geQleA17mAhz08IG0NKEfonDBJY5NeDXhjqR0ZIAeXHovpZkXUZNQt-EWl8ufTrmRFqd3AQdbIOvIXORfwCugvupfJ_t__Lqw |
| CODEN | EJORDT |
| CitedBy_id | crossref_primary_10_1057_jors_2012_155 crossref_primary_10_1007_s10951_012_0297_6 crossref_primary_10_1016_j_asoc_2020_106736 crossref_primary_10_1016_j_ejor_2020_03_029 crossref_primary_10_1007_s00453_025_01331_x crossref_primary_10_1109_TASE_2018_2884618 crossref_primary_10_1007_s10472_019_09646_6 crossref_primary_10_1016_j_ejor_2014_03_012 crossref_primary_10_1016_j_ejor_2024_05_029 crossref_primary_10_1016_j_ejor_2015_01_003 crossref_primary_10_1080_00207543_2013_849825 crossref_primary_10_1002_nav_22256 crossref_primary_10_1007_s10588_017_9247_3 crossref_primary_10_1007_s10951_015_0455_8 crossref_primary_10_1016_j_cie_2017_01_023 crossref_primary_10_1016_j_omega_2021_102431 crossref_primary_10_1007_s00170_011_3180_2 crossref_primary_10_1007_s11740_020_01013_3 crossref_primary_10_1007_s00291_012_0311_6 crossref_primary_10_1007_s10951_012_0266_0 crossref_primary_10_1016_j_ejor_2016_09_007 crossref_primary_10_1002_cpe_6540 crossref_primary_10_1145_3178539 crossref_primary_10_1145_3450524 crossref_primary_10_1007_s10951_015_0433_1 crossref_primary_10_1016_j_cie_2022_108662 crossref_primary_10_1007_s10951_011_0261_x crossref_primary_10_56809_icujtas_1512826 crossref_primary_10_1016_j_orl_2015_09_004 crossref_primary_10_1016_j_tcs_2014_11_007 crossref_primary_10_1007_s10479_015_1993_3 crossref_primary_10_1007_s10951_013_0346_9 crossref_primary_10_1016_j_ejor_2022_03_047 crossref_primary_10_1155_2018_8073648 crossref_primary_10_1016_j_cie_2012_02_006 crossref_primary_10_1016_j_ejor_2015_07_001 crossref_primary_10_1016_j_swevo_2022_101200 crossref_primary_10_1080_21681015_2019_1647300 crossref_primary_10_1016_j_ejor_2021_07_001 |
| Cites_doi | 10.1007/s001860200251 10.1016/S0377-2217(98)00017-4 10.1016/j.ejor.2004.04.019 10.1002/jos.91 10.1016/j.ejor.2004.04.018 10.1016/j.cie.2005.07.002 10.1007/s00291-005-0008-1 10.1145/77600.77615 10.1287/moor.17.1.36 10.1016/S0004-3702(02)00362-4 10.1016/j.ejor.2006.10.047 10.1145/322203.322213 10.1016/S0167-5060(08)70743-X 10.1007/s00291-003-0133-7 10.1007/s00291-008-0139-2 10.1007/s002910000042 10.1016/j.dam.2009.02.012 10.1016/j.ejor.2007.11.010 10.1002/nav.20095 |
| ContentType | Journal Article |
| Copyright | 2010 Elsevier B.V. 2015 INIST-CNRS Copyright Elsevier Sequoia S.A. Dec 1, 2010 |
| Copyright_xml | – notice: 2010 Elsevier B.V. – notice: 2015 INIST-CNRS – notice: Copyright Elsevier Sequoia S.A. Dec 1, 2010 |
| DBID | AAYXX CITATION OQ6 IQODW DKI X2L 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D 7TA JG9 |
| DOI | 10.1016/j.ejor.2010.05.036 |
| DatabaseName | CrossRef ECONIS Pascal-Francis RePEc IDEAS RePEc Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Materials Business File Materials Research Database |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Materials Research Database Materials Business File |
| DatabaseTitleList | Materials Research Database Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business Applied Sciences |
| EISSN | 1872-6860 |
| EndPage | 619 |
| ExternalDocumentID | 2115432741 eeeejores_v_3a207_3ay_3a2010_3ai_3a2_3ap_3a605_619_htm 23117427 635289539 10_1016_j_ejor_2010_05_036 S0377221710003929 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1OL 1RT 1~. 1~5 29G 4.4 41~ 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADIYS ADJOM ADMUD AEBSH AEFWE AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U VH1 WUQ XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADXHL AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD OQ6 AFXIZ AGCQF AGRNS BNPGV IQODW SSH 02 08R 0R 1 41 6XO 8P AAPBV ABFLS ADALY DKI G- HZ IPNFZ K M MS PQEST STF X X2L 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D 7TA JG9 |
| ID | FETCH-LOGICAL-c512t-b71fe3bbbd7117c1a6799c8311c140e9537947650a6ee5f601d8001bb00fcb7f3 |
| ISICitedReferencesCount | 44 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000281107200007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Sun Nov 09 10:52:05 EST 2025 Mon Jul 14 10:06:01 EDT 2025 Wed Aug 18 03:50:56 EDT 2021 Mon Jul 21 09:11:39 EDT 2025 Sat Mar 08 16:22:31 EST 2025 Sat Nov 29 01:41:00 EST 2025 Tue Nov 18 21:07:20 EST 2025 Fri Feb 23 02:32:27 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Inventory constraints Polynomial-time algorithms Machine scheduling Computational complexity Strong NP-hardness Minimization Scheduling Makespan Polynomial method Delay Polynomial time Production management NP hard problem Lateness Single machine |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c512t-b71fe3bbbd7117c1a6799c8311c140e9537947650a6ee5f601d8001bb00fcb7f3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| PQID | 745951407 |
| PQPubID | 45678 |
| PageCount | 15 |
| ParticipantIDs | proquest_miscellaneous_760210939 proquest_journals_745951407 repec_primary_eeeejores_v_3a207_3ay_3a2010_3ai_3a2_3ap_3a605_619_htm pascalfrancis_primary_23117427 econis_primary_635289539 crossref_primary_10_1016_j_ejor_2010_05_036 crossref_citationtrail_10_1016_j_ejor_2010_05_036 elsevier_sciencedirect_doi_10_1016_j_ejor_2010_05_036 |
| PublicationCentury | 2000 |
| PublicationDate | 2010-12-01 |
| PublicationDateYYYYMMDD | 2010-12-01 |
| PublicationDate_xml | – month: 12 year: 2010 text: 2010-12-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationSeriesTitle | European Journal of Operational Research |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2010 |
| Publisher | Elsevier B.V Elsevier Elsevier Sequoia S.A |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier – name: Elsevier Sequoia S.A |
| References | Neumann, Schwindt (bib14) 2002; 56 Ahuja, Mehlhorn, Orlin, Tarjan (bib1) 1990; 37 Brucker, Heitmann, Hurink (bib5) 2003; 25 Nowicki (bib16) 1999; 116 McWilliams, Stanfield, Geiger (bib13) 2005; 49 Grigoriev, Holthuijsen, Klundert (bib9) 2005; 52 Neumann, Schwindt, Trautmann (bib15) 2005; 165 Beck (bib3) 2002; 5 Boysen, Fliedner, Scholl (bib4) 2010; 32 Graham, Lawler, Lenstra, Rinnooy Kan (bib8) 1979; 5 Sourd, Rogerie (bib19) 2005; 165 Carlier, Moukrim, Xu (bib7) 2009; 157 Lenstra, Rinnooy Kan, Brucker (bib12) 1977; 1 Papadimitriou, Kanellakis (bib17) 1980; 27 Bartels, Zimmermann (bib2) 2009; 193 Brucker, Heitmann, Hurink, Nieberg (bib6) 2006; 28 Laborie (bib11) 2003; 143 Hassin (bib10) 1992; 17 Yu, Egbelu (bib20) 2008; 184 Schwindt, Trautmann (bib18) 2000; 22 Beck (10.1016/j.ejor.2010.05.036_bib3) 2002; 5 Grigoriev (10.1016/j.ejor.2010.05.036_bib9) 2005; 52 Yu (10.1016/j.ejor.2010.05.036_bib20) 2008; 184 Brucker (10.1016/j.ejor.2010.05.036_bib5) 2003; 25 Boysen (10.1016/j.ejor.2010.05.036_bib4) 2010; 32 Brucker (10.1016/j.ejor.2010.05.036_bib6) 2006; 28 Neumann (10.1016/j.ejor.2010.05.036_bib14) 2002; 56 McWilliams (10.1016/j.ejor.2010.05.036_bib13) 2005; 49 Hassin (10.1016/j.ejor.2010.05.036_bib10) 1992; 17 Bartels (10.1016/j.ejor.2010.05.036_bib2) 2009; 193 Laborie (10.1016/j.ejor.2010.05.036_bib11) 2003; 143 Papadimitriou (10.1016/j.ejor.2010.05.036_bib17) 1980; 27 Nowicki (10.1016/j.ejor.2010.05.036_bib16) 1999; 116 Carlier (10.1016/j.ejor.2010.05.036_bib7) 2009; 157 Schwindt (10.1016/j.ejor.2010.05.036_bib18) 2000; 22 Ahuja (10.1016/j.ejor.2010.05.036_bib1) 1990; 37 Graham (10.1016/j.ejor.2010.05.036_bib8) 1979; 5 Lenstra (10.1016/j.ejor.2010.05.036_bib12) 1977; 1 Neumann (10.1016/j.ejor.2010.05.036_bib15) 2005; 165 Sourd (10.1016/j.ejor.2010.05.036_bib19) 2005; 165 |
| References_xml | – volume: 17 start-page: 36 year: 1992 end-page: 42 ident: bib10 article-title: Approximation schemes for the restricted shortest path problem publication-title: Mathematics of Operations Research – volume: 1 start-page: 343 year: 1977 end-page: 362 ident: bib12 article-title: Complexity of machine scheduling problems publication-title: Annals of Discrete Mathematics – volume: 5 start-page: 236 year: 1979 end-page: 287 ident: bib8 article-title: Optimisation and approximation in deterministic sequencing and scheduling: a survey publication-title: Annals of Discrete Mathematics – volume: 52 start-page: 527 year: 2005 end-page: 535 ident: bib9 article-title: Basic scheduling problems with raw material constraints publication-title: Naval Research Logistics – volume: 49 start-page: 393 year: 2005 end-page: 412 ident: bib13 article-title: The parcel hub scheduling problem: a simulation-based solution approach publication-title: Computers and Industrial Engineering – volume: 5 start-page: 43 year: 2002 end-page: 69 ident: bib3 article-title: Heuristics for scheduling with inventory: dynamic focus via constraint criticality publication-title: Journal of Scheduling – volume: 143 start-page: 151 year: 2003 end-page: 188 ident: bib11 article-title: Algorithms for propagating resource constraints in ai planning and scheduling: existing approaches and new results publication-title: Artificial Intelligence – volume: 28 start-page: 151 year: 2006 end-page: 176 ident: bib6 article-title: Job-shop scheduling with limited capacity buffers publication-title: OR Spectrum – volume: 157 start-page: 3631 year: 2009 end-page: 3642 ident: bib7 article-title: The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm publication-title: Discrete Applied Mathematics – volume: 193 start-page: 805 year: 2009 end-page: 819 ident: bib2 article-title: Scheduling tests in automotive R&D projects publication-title: European Journal of Operational Research – volume: 25 start-page: 549 year: 2003 end-page: 574 ident: bib5 article-title: Flow shop scheduling with intermediate buffers publication-title: OR Spectrum – volume: 165 start-page: 510 year: 2005 end-page: 524 ident: bib19 article-title: Continuous filling and emptying of storage systems in constraint-based scheduling publication-title: European Journal of Operational Research – volume: 37 start-page: 213 year: 1990 end-page: 223 ident: bib1 article-title: Faster algorithms for the shortest path problem publication-title: Journal of the Association for Computing Machinery – volume: 27 start-page: 533 year: 1980 end-page: 549 ident: bib17 article-title: Flow shop scheduling with limited temporary storage publication-title: Journal of the Association for Computing Machinery – volume: 184 start-page: 377 year: 2008 end-page: 396 ident: bib20 article-title: Scheduling of inbound and outbound trucks in cross docking systems with temporary storage publication-title: European Journal of Operational Research – volume: 165 start-page: 495 year: 2005 end-page: 509 ident: bib15 article-title: Scheduling of continuous and discontinuous material flows with intermediate storage restrictions publication-title: European Journal of Operational Research – volume: 56 start-page: 513 year: 2002 end-page: 533 ident: bib14 article-title: Project scheduling with inventory constraints publication-title: Mathematical Methods of Operations Research – volume: 22 start-page: 501 year: 2000 end-page: 524 ident: bib18 article-title: Batch scheduling in process industries: an application of resource-constrained project scheduling publication-title: OR Spectrum – volume: 32 start-page: 135 year: 2010 end-page: 161 ident: bib4 article-title: Scheduling inbound and outbound trucks at cross docking terminals publication-title: OR Spectrum – volume: 116 start-page: 205 year: 1999 end-page: 219 ident: bib16 article-title: The permutation shop with buffers: a tabu search approach publication-title: European Journal of Operational Research – volume: 56 start-page: 513 year: 2002 ident: 10.1016/j.ejor.2010.05.036_bib14 article-title: Project scheduling with inventory constraints publication-title: Mathematical Methods of Operations Research doi: 10.1007/s001860200251 – volume: 116 start-page: 205 year: 1999 ident: 10.1016/j.ejor.2010.05.036_bib16 article-title: The permutation shop with buffers: a tabu search approach publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(98)00017-4 – volume: 165 start-page: 510 year: 2005 ident: 10.1016/j.ejor.2010.05.036_bib19 article-title: Continuous filling and emptying of storage systems in constraint-based scheduling publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.04.019 – volume: 5 start-page: 43 year: 2002 ident: 10.1016/j.ejor.2010.05.036_bib3 article-title: Heuristics for scheduling with inventory: dynamic focus via constraint criticality publication-title: Journal of Scheduling doi: 10.1002/jos.91 – volume: 165 start-page: 495 year: 2005 ident: 10.1016/j.ejor.2010.05.036_bib15 article-title: Scheduling of continuous and discontinuous material flows with intermediate storage restrictions publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.04.018 – volume: 49 start-page: 393 year: 2005 ident: 10.1016/j.ejor.2010.05.036_bib13 article-title: The parcel hub scheduling problem: a simulation-based solution approach publication-title: Computers and Industrial Engineering doi: 10.1016/j.cie.2005.07.002 – volume: 28 start-page: 151 year: 2006 ident: 10.1016/j.ejor.2010.05.036_bib6 article-title: Job-shop scheduling with limited capacity buffers publication-title: OR Spectrum doi: 10.1007/s00291-005-0008-1 – volume: 37 start-page: 213 year: 1990 ident: 10.1016/j.ejor.2010.05.036_bib1 article-title: Faster algorithms for the shortest path problem publication-title: Journal of the Association for Computing Machinery doi: 10.1145/77600.77615 – volume: 17 start-page: 36 issue: 1 year: 1992 ident: 10.1016/j.ejor.2010.05.036_bib10 article-title: Approximation schemes for the restricted shortest path problem publication-title: Mathematics of Operations Research doi: 10.1287/moor.17.1.36 – volume: 143 start-page: 151 year: 2003 ident: 10.1016/j.ejor.2010.05.036_bib11 article-title: Algorithms for propagating resource constraints in ai planning and scheduling: existing approaches and new results publication-title: Artificial Intelligence doi: 10.1016/S0004-3702(02)00362-4 – volume: 184 start-page: 377 year: 2008 ident: 10.1016/j.ejor.2010.05.036_bib20 article-title: Scheduling of inbound and outbound trucks in cross docking systems with temporary storage publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.10.047 – volume: 27 start-page: 533 year: 1980 ident: 10.1016/j.ejor.2010.05.036_bib17 article-title: Flow shop scheduling with limited temporary storage publication-title: Journal of the Association for Computing Machinery doi: 10.1145/322203.322213 – volume: 1 start-page: 343 year: 1977 ident: 10.1016/j.ejor.2010.05.036_bib12 article-title: Complexity of machine scheduling problems publication-title: Annals of Discrete Mathematics doi: 10.1016/S0167-5060(08)70743-X – volume: 25 start-page: 549 year: 2003 ident: 10.1016/j.ejor.2010.05.036_bib5 article-title: Flow shop scheduling with intermediate buffers publication-title: OR Spectrum doi: 10.1007/s00291-003-0133-7 – volume: 32 start-page: 135 year: 2010 ident: 10.1016/j.ejor.2010.05.036_bib4 article-title: Scheduling inbound and outbound trucks at cross docking terminals publication-title: OR Spectrum doi: 10.1007/s00291-008-0139-2 – volume: 22 start-page: 501 issue: 4 year: 2000 ident: 10.1016/j.ejor.2010.05.036_bib18 article-title: Batch scheduling in process industries: an application of resource-constrained project scheduling publication-title: OR Spectrum doi: 10.1007/s002910000042 – volume: 157 start-page: 3631 year: 2009 ident: 10.1016/j.ejor.2010.05.036_bib7 article-title: The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2009.02.012 – volume: 193 start-page: 805 issue: 3 year: 2009 ident: 10.1016/j.ejor.2010.05.036_bib2 article-title: Scheduling tests in automotive R&D projects publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2007.11.010 – volume: 5 start-page: 236 year: 1979 ident: 10.1016/j.ejor.2010.05.036_bib8 article-title: Optimisation and approximation in deterministic sequencing and scheduling: a survey publication-title: Annals of Discrete Mathematics – volume: 52 start-page: 527 year: 2005 ident: 10.1016/j.ejor.2010.05.036_bib9 article-title: Basic scheduling problems with raw material constraints publication-title: Naval Research Logistics doi: 10.1002/nav.20095 |
| SSID | ssj0001515 |
| Score | 2.2118964 |
| Snippet | This paper focuses on single machine scheduling subject to inventory constraints. Jobs either add items to an inventory or remove items from that inventory.... |
| SourceID | proquest repec pascalfrancis econis crossref elsevier |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 605 |
| SubjectTerms | Applied sciences Completion time Complexity Complexity theory Computation Computational complexity Exact sciences and technology Inventories Inventory constraints Inventory control, production control. Distribution Inventory management Job shops Lateness Machine scheduling Machine scheduling Inventory constraints Computational complexity Strong NP-hardness Polynomial-time algorithms Operational research Operational research and scientific management Operational research. Management science Optimization Optimization algorithms Polynomial-time algorithms Production scheduling Scheduling Scheduling, sequencing Stockpiling Strong NP-hardness Studies |
| Title | Complexity of single machine scheduling subject to nonnegative inventory constraints |
| URI | https://dx.doi.org/10.1016/j.ejor.2010.05.036 http://www.econis.eu/PPNSET?PPN=635289539 http://econpapers.repec.org/article/eeeejores/v_3a207_3ay_3a2010_3ai_3a2_3ap_3a605-619.htm https://www.proquest.com/docview/745951407 https://www.proquest.com/docview/760210939 |
| Volume | 207 |
| WOSCitedRecordID | wos000281107200007&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: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELdKOyEQ4qOAVgaTH3ibMsVJHCePWxniQ5p4KFLfrDh11paSVP3S9rfwz3IXO2laxsQeqJQoclPXyd35Pvy7MyHvYyWEDlzlRB5Gq9woc1TicicQWgWg7_xMZOVmE-LyMhoO42-t1q8qF2YzE3keXV_H8_9KamgDYmPq7D3IXXcKDXANRIczkB3O_0R4lHCscmmgFhgKmCFIFTGT-gR8WdAtZQr6cq0wBoPGZ45olytTAnxSotBx5T1F0xF3kDDFnm6N31tbFhoWVVTRlg-qw8zniF4vDGYYJtg6M6g_LkokwfkNzDdOf6yLfXTQ1yS_UsWPbeu6gg-XqxaNeMUO9sPmaQnheJ7J2KzmYM9sfWuZzWvMqKHLG8o5NPPrH_O-CUFMT_W0WFi8Hj91_VuKbO8pvxqSWKHdphL7kNiHdLmEPh6Qjid4HLVJ5-zzxfBLrejRFiwXqewD2ZwsAx_cH8mO3XOAwY7JcscAejJPliCWmdlPZcfh6Sz0XKcNu2fwnDy1Dgs9M4z2grR03iUPq3yJLnlW7QtCrZrokseNIpcvyWDLkLTIqGFIahmSbhmSWoakq4I2GJLWDEkbDPmKfP94Meh_cuxeHk4KJuXKUYJl2ldKjQRjImVJKOI4jXzGUnDxdcx9UAwC3IUk1JpnoctG4MowBVohS5XI_NekDf-tDwl1WaY495LIT0cBT8DFATMzTdiIgS0vhNsjrHrTMrWF7nFwM_l3GvfISf2buSnzcufdh4aA9b0hFkmCh4h7hFckldaGNbapBFa9s8vjHfrXPYP_xUTgiR45qhhCWvleShFw8JACF76l9begH3DRL8l1sYZbQozqxDiyDyUb1T1r-MAo9FJupJ-ABML5pryCUfnJBC_hmMMBQihB9OR49fPNvd7UEXm0nQPekvZqsdbvyEG6WU2Wi2MrUL8BTI73UQ |
| 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=Complexity+of+single+machine+scheduling+subject+to+nonnegative+inventory+constraints&rft.jtitle=European+journal+of+operational+research&rft.au=Briskorn%2C+Dirk&rft.au=Choi%2C+Byung-Cheon&rft.au=Lee%2C+Kangbok&rft.au=Leung%2C+Joseph&rft.date=2010-12-01&rft.issn=0377-2217&rft.volume=207&rft.issue=2&rft.spage=605&rft.epage=619&rft_id=info:doi/10.1016%2Fj.ejor.2010.05.036&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2010_05_036 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |