IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v27y2024i3d10.1007_s10951-023-00798-2.html
   My bibliography  Save this article

Dynamic scheduling problems in theory and practice

Author

Listed:
  • Stanisław Gawiejnowicz

    (Adam Mickiewicz University)

  • Bertrand Miao-Tsong Lin

    (National Yang Ming Chiao Tung University)

  • Gur Mosheiov

    (The Hebrew University of Jerusalem)

Abstract

No abstract is available for this item.

Suggested Citation

  • Stanisław Gawiejnowicz & Bertrand Miao-Tsong Lin & Gur Mosheiov, 2024. "Dynamic scheduling problems in theory and practice," Journal of Scheduling, Springer, vol. 27(3), pages 225-226, June.
    • Handle: RePEc:spr:jsched:v:27:y:2024:i:3:d:10.1007_s10951-023-00798-2
    DOI: 10.1007/s10951-023-00798-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-023-00798-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-023-00798-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Ameni Azzouz & Meriem Ennigrou & Lamjed Ben Said, 2018. "Scheduling problems under learning effects: classification and cartography," International Journal of Production Research, Taylor & Francis Journals, vol. 56(4), pages 1642-1661, February.
    2. Vitaly A. Strusevich & Kabir Rustogi, 2017. "Scheduling with Time-Changing Effects and Rate-Modifying Activities," International Series in Operations Research and Management Science, Springer, number 978-3-319-39574-6, June.
    3. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    Full references (including those not matched with items on IDEAS)

    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. Matan Atsmony & Baruch Mor & Gur Mosheiov, 2024. "Single machine scheduling with step-learning," Journal of Scheduling, Springer, vol. 27(3), pages 227-237, June.
    2. Phosavanh, Johnson & Oron, Daniel, 2025. "Minimizing the number of late jobs and total late work with step-learning," European Journal of Operational Research, Elsevier, vol. 321(3), pages 734-749.
    3. Frederik Ferid Ostermeier & Jochen Deuse, 2024. "Modelling forgetting due to intermittent production in mixed-model line scheduling," Flexible Services and Manufacturing Journal, Springer, vol. 36(2), pages 503-532, June.
    4. Stanisław Gawiejnowicz & Wiesław Kurc, 2020. "New results for an open time-dependent scheduling problem," Journal of Scheduling, Springer, vol. 23(6), pages 733-744, December.
    5. Xinyu Sun & Tao Liu & Xin-Na Geng & Yang Hu & Jing-Xiao Xu, 2023. "Optimization of scheduling problems with deterioration effects and an optional maintenance activity," Journal of Scheduling, Springer, vol. 26(3), pages 251-266, June.
    6. Zong-Jun Wei & Li-Yan Wang & Lei Zhang & Ji-Bo Wang & Ershen Wang, 2023. "Single-Machine Maintenance Activity Scheduling with Convex Resource Constraints and Learning Effects," Mathematics, MDPI, vol. 11(16), pages 1-21, August.
    7. Delorme, Maxence & Iori, Manuel & Mendes, Nilson F.M., 2021. "Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events," European Journal of Operational Research, Elsevier, vol. 295(3), pages 823-837.
    8. Helmut A. Sedding, 2020. "Scheduling jobs with a V-shaped time-dependent processing time," Journal of Scheduling, Springer, vol. 23(6), pages 751-768, December.
    9. Frederik Ferid Ostermeier & Jochen Deuse, 2024. "A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing," Journal of Scheduling, Springer, vol. 27(1), pages 29-49, February.
    10. Dvir Shabtay & Baruch Mor, 2024. "Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times," Journal of Scheduling, Springer, vol. 27(3), pages 239-256, June.
    11. Briskorn, Dirk & Gönsch, Jochen & Thiemeyer, Antonia, 2024. "Scheduling maintenance activities subject to stochastic job-dependent machine deterioration," European Journal of Operational Research, Elsevier, vol. 319(1), pages 62-78.
    12. Chen, Ke & Cheng, T.C.E. & Huang, Hailiang & Ji, Min & Yao, Danli, 2023. "Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 309(1), pages 24-34.
    13. Baruch Mor & Joanna Berlińska, 2025. "Scheduling problems on parallel dedicated machines with non-renewable resource," Annals of Operations Research, Springer, vol. 346(3), pages 2173-2193, March.
    14. Rubing Chen & Jinjiang Yuan, 2020. "Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices," 4OR, Springer, vol. 18(2), pages 177-196, June.
    15. Hongyu He & Yanzhi Zhao & Xiaojun Ma & Yuan-Yuan Lu & Na Ren & Ji-Bo Wang, 2023. "Study on Scheduling Problems with Learning Effects and Past Sequence Delivery Times," Mathematics, MDPI, vol. 11(19), pages 1-19, September.
    16. Zheng-Guo Lv & Li-Han Zhang & Xiao-Yuan Wang & Ji-Bo Wang, 2024. "Single Machine Scheduling Proportionally Deteriorating Jobs with Ready Times Subject to the Total Weighted Completion Time Minimization," Mathematics, MDPI, vol. 12(4), pages 1-15, February.
    17. Zhongyi Jiang & Fangfang Chen & Xiandong Zhang, 2022. "Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 116-139, January.
    18. Bakker, Steffen J. & Wang, Akang & Gounaris, Chrysanthos E., 2021. "Vehicle routing with endogenous learning: Application to offshore plug and abandonment campaign planning," European Journal of Operational Research, Elsevier, vol. 289(1), pages 93-106.
    19. Alan J. Soper & Vitaly A. Strusevich, 2020. "Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects," Journal of Scheduling, Springer, vol. 23(6), pages 665-680, December.
    20. Ming-Hui Li & Dan-Yang Lv & Yuan-Yuan Lu & Ji-Bo Wang, 2024. "Scheduling with Group Technology, Resource Allocation, and Learning Effect Simultaneously," Mathematics, MDPI, vol. 12(7), pages 1-21, March.

    More about this item

    Statistics

    Access and download statistics

    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:spr:jsched:v:27:y:2024:i:3:d:10.1007_s10951-023-00798-2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.