IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v207y2010i2p605-619.html
   My bibliography  Save this article

Complexity of single machine scheduling subject to nonnegative inventory constraints

Author

Listed:
  • Briskorn, Dirk
  • Choi, Byung-Cheon
  • Lee, Kangbok
  • Leung, Joseph
  • Pinedo, Michael

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.

Suggested Citation

  • Briskorn, Dirk & Choi, Byung-Cheon & Lee, Kangbok & Leung, Joseph & Pinedo, Michael, 2010. "Complexity of single machine scheduling subject to nonnegative inventory constraints," European Journal of Operational Research, Elsevier, vol. 207(2), pages 605-619, December.
    • Handle: RePEc:eee:ejores:v:207:y:2010:i:2:p:605-619
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00392-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bartels, J.-H. & Zimmermann, J., 2009. "Scheduling tests in automotive R&D projects," European Journal of Operational Research, Elsevier, vol. 193(3), pages 805-819, March.
    2. Sourd, Francis & Rogerie, Jerome, 2005. "Continuous filling and emptying of storage systems in constraint-based scheduling," European Journal of Operational Research, Elsevier, vol. 165(2), pages 510-524, September.
    3. Neumann, Klaus & Schwindt, Christoph & Trautmann, Norbert, 2005. "Scheduling of continuous and discontinuous material flows with intermediate storage restrictions," European Journal of Operational Research, Elsevier, vol. 165(2), pages 495-509, September.
    4. Nowicki, Eugeniusz, 1999. "The permutation flow shop with buffers: A tabu search approach," European Journal of Operational Research, Elsevier, vol. 116(1), pages 205-219, July.
    5. Yu, Wooyeon & Egbelu, Pius J., 2008. "Scheduling of inbound and outbound trucks in cross docking systems with temporary storage," European Journal of Operational Research, Elsevier, vol. 184(1), pages 377-396, January.
    6. Refael Hassin, 1992. "Approximation Schemes for the Restricted Shortest Path Problem," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 36-42, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Herr, Oliver & Goel, Asvin, 2016. "Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints," European Journal of Operational Research, Elsevier, vol. 248(1), pages 123-135.
    2. Wolff, Pascal & Emde, Simon & Pfohl, Hans-Christian, 2021. "Internal resource requirements: The better performance metric for truck scheduling?," Omega, Elsevier, vol. 103(C).
    3. Oron, Daniel & Shabtay, Dvir & Steiner, George, 2015. "Single machine scheduling with two competing agents and equal job processing times," European Journal of Operational Research, Elsevier, vol. 244(1), pages 86-99.
    4. Rupp, Johannes & Boysen, Nils & Briskorn, Dirk, 2022. "Optimizing consolidation processes in hubs: The hub-arrival-departure problem," European Journal of Operational Research, Elsevier, vol. 298(3), pages 1051-1066.
    5. Buijs, Paul & Vis, Iris F.A. & Carlo, Héctor J., 2014. "Synchronization in cross-docking networks: A research classification and framework," European Journal of Operational Research, Elsevier, vol. 239(3), pages 593-608.
    6. Györgyi, Péter & Kis, Tamás, 2017. "Approximation schemes for parallel machine scheduling with non-renewable resources," European Journal of Operational Research, Elsevier, vol. 258(1), pages 113-123.
    7. Péter Györgyi & Tamás Kis, 2015. "Approximability of scheduling problems with resource consuming jobs," Annals of Operations Research, Springer, vol. 235(1), pages 319-336, December.
    8. Saeid Rezaei & Amirsaman Kheirkhah, 2018. "A comprehensive approach in designing a sustainable closed-loop supply chain network using cross-docking operations," Computational and Mathematical Organization Theory, Springer, vol. 24(1), pages 51-98, March.
    9. Gehring, Marco & Volk, Rebekka & Schultmann, Frank, 2022. "On the integration of diverging material flows into resource‐constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1071-1087.
    10. Davari, Morteza & Ranjbar, Mohammad & De Causmaecker, Patrick & Leus, Roel, 2020. "Minimizing makespan on a single machine with release dates and inventory constraints," European Journal of Operational Research, Elsevier, vol. 286(1), pages 115-128.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Briskorn, Dirk & Choi, Byung-Cheon & Lee, Kangbok & Leung, Joseph & Pinedo, Michael, 2009. "Genetic algorithms for inventory constrained scheduling on a single machine," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 649, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. Gehring, Marco & Volk, Rebekka & Schultmann, Frank, 2022. "On the integration of diverging material flows into resource‐constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1071-1087.
    3. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    4. Hartmann, Sönke & Briskorn, Dirk, 2008. "A survey of variants and extensions of the resource-constrained project scheduling problem," Working Paper Series 02/2008, Hamburg School of Business Administration (HSBA).
    5. Briskorn, Dirk & Choi, Byung-Cheon & Lee, Kangbok & Leung, Joseph & Pinedo, Michael, 2008. "Inventory constrained scheduling on a single machine," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 640, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    6. Jianxin Fang & Brenda Cheang & Andrew Lim, 2023. "Problems and Solution Methods of Machine Scheduling in Semiconductor Manufacturing Operations: A Survey," Sustainability, MDPI, vol. 15(17), pages 1-44, August.
    7. Mohammad Amin Amani & Mohammad Mahdi Nasiri, 2023. "A novel cross docking system for distributing the perishable products considering preemption: a machine learning approach," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-32, July.
    8. Gaudioso, Manlio & Monaco, Maria Flavia & Sammarra, Marcello, 2021. "A Lagrangian heuristics for the truck scheduling problem in multi-door, multi-product Cross-Docking with constant processing time," Omega, Elsevier, vol. 101(C).
    9. Esaignani Selvarajah & Rui Zhang, 2014. "Supply chain scheduling to minimize holding costs with outsourcing," Annals of Operations Research, Springer, vol. 217(1), pages 479-490, June.
    10. Randeep Bhatia & Sudipto Guha & Samir Khuller & Yoram J. Sussmann, 1998. "Facility Location with Dynamic Distance Functions," Journal of Combinatorial Optimization, Springer, vol. 2(3), pages 199-217, September.
    11. Geng, Zhichao & Yuan, Jinjiang, 2023. "Single-machine scheduling of multiple projects with controllable processing times," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1074-1090.
    12. Maxim A. Dulebenets, 2018. "A Diploid Evolutionary Algorithm for Sustainable Truck Scheduling at a Cross-Docking Facility," Sustainability, MDPI, vol. 10(5), pages 1-23, April.
    13. Chen, Lu & Bostel, Nathalie & Dejax, Pierre & Cai, Jianguo & Xi, Lifeng, 2007. "A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal," European Journal of Operational Research, Elsevier, vol. 181(1), pages 40-58, August.
    14. Berghman, Lotte & Leus, Roel, 2015. "Practical solutions for a dock assignment problem with trailer transportation," European Journal of Operational Research, Elsevier, vol. 246(3), pages 787-799.
    15. Smutnicki, Czeslaw & Pempera, Jaroslaw & Bocewicz, Grzegorz & Banaszak, Zbigniew, 2022. "Cyclic flow-shop scheduling with no-wait constraints and missing operations," European Journal of Operational Research, Elsevier, vol. 302(1), pages 39-49.
    16. Boaz Golany & Moshe Kress & Michal Penn & Uriel G. Rothblum, 2012. "Network Optimization Models for Resource Allocation in Developing Military Countermeasures," Operations Research, INFORMS, vol. 60(1), pages 48-63, February.
    17. Miao, Zhaowei & Lim, Andrew & Ma, Hong, 2009. "Truck dock assignment problem with operational time constraint within crossdocks," European Journal of Operational Research, Elsevier, vol. 192(1), pages 105-115, January.
    18. Dulebenets, Maxim A., 2019. "A Delayed Start Parallel Evolutionary Algorithm for just-in-time truck scheduling at a cross-docking facility," International Journal of Production Economics, Elsevier, vol. 212(C), pages 236-258.
    19. Shi, Yuhui & Reich, Daniel & Epelman, Marina & Klampfl, Erica & Cohn, Amy, 2017. "An analytical approach to prototype vehicle test scheduling," Omega, Elsevier, vol. 67(C), pages 168-176.
    20. Xie, Chi & Travis Waller, S., 2012. "Parametric search and problem decomposition for approximating Pareto-optimal paths," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1043-1067.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:207:y:2010:i:2:p:605-619. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.