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

Scheduling deteriorating jobs subject to job or machine availability constraints

Author

Listed:
  • Gawiejnowicz, Stanislaw

Abstract

No abstract is available for this item.

Suggested Citation

  • Gawiejnowicz, Stanislaw, 2007. "Scheduling deteriorating jobs subject to job or machine availability constraints," European Journal of Operational Research, Elsevier, vol. 180(1), pages 472-478, July.
  • Handle: RePEc:eee:ejores:v:180:y:2007:i:1:p:472-478
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00274-8
    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. Schmidt, Gunter, 2000. "Scheduling with limited machine availability," European Journal of Operational Research, Elsevier, vol. 121(1), pages 1-15, February.
    2. Cheng, T. C. E. & Ding, Q. & Lin, B. M. T., 2004. "A concise survey of scheduling with time-dependent processing times," European Journal of Operational Research, Elsevier, vol. 152(1), pages 1-13, January.
    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. Chuanli Zhao & Hengyong Tang, 2016. "Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(06), pages 1-10, December.
    2. Yang, Suh-Jenq & Yang, Dar-Li, 2010. "Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities," Omega, Elsevier, vol. 38(6), pages 528-533, December.
    3. Gawiejnowicz, Stanislaw & Kononov, Alexander, 2010. "Complexity and approximability of scheduling resumable proportionally deteriorating jobs," European Journal of Operational Research, Elsevier, vol. 200(1), pages 305-308, January.
    4. 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.
    5. Ng, C.T. & Barketau, M.S. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2010. ""Product Partition" and related problems of scheduling and systems reliability: Computational complexity and approximation," European Journal of Operational Research, Elsevier, vol. 207(2), pages 601-604, December.
    6. Xu, Dehua & Yin, Yunqiang & Li, Hongxing, 2009. "A note on "scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan"," European Journal of Operational Research, Elsevier, vol. 197(2), pages 825-827, September.
    7. Li, Shisheng & Ng, C.T. & Cheng, T.C.E. & Yuan, Jinjiang, 2011. "Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 210(3), pages 482-488, May.
    8. 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.
    9. Zhong, Xueling & Ou, Jinwen & Wang, Guoqing, 2014. "Order acceptance and scheduling with machine availability constraints," European Journal of Operational Research, Elsevier, vol. 232(3), pages 435-441.
    10. 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.
    11. Wenhua Li & Libo Wang & Xing Chai & Hang Yuan, 2020. "Online Batch Scheduling of Simple Linear Deteriorating Jobs with Incompatible Families," Mathematics, MDPI, vol. 8(2), pages 1-12, February.
    12. Sun, Linhui & Sun, Linyan & Cui, Kai & Wang, Ji-Bo, 2010. "A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines," European Journal of Operational Research, Elsevier, vol. 200(1), pages 309-311, January.

    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. Yang, Suh-Jenq & Yang, Dar-Li, 2010. "Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities," Omega, Elsevier, vol. 38(6), pages 528-533, December.
    2. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
    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.
    4. Guohua Wan & Xiangtong Qi, 2010. "Scheduling with variable time slot costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(2), pages 159-171, March.
    5. M. A. Kubzin & V. A. Strusevich, 2006. "Planning Machine Maintenance in Two-Machine Shop Scheduling," Operations Research, INFORMS, vol. 54(4), pages 789-800, August.
    6. A. Beynaghi & F. Moztarzadeh & A. Shahmardan & R. Alizadeh & J. Salimi & M. Mozafari, 2019. "Makespan minimization for batching work and rework process on a single facility with an aging effect: a hybrid meta-heuristic algorithm for sustainable production management," Journal of Intelligent Manufacturing, Springer, vol. 30(1), pages 33-45, January.
    7. Wang, Xiuli & Cheng, T.C.E., 2015. "A heuristic for scheduling jobs on two identical parallel machines with a machine availability constraint," International Journal of Production Economics, Elsevier, vol. 161(C), pages 74-82.
    8. C-C He & C-C Wu & W-C Lee, 2009. "Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1759-1766, December.
    9. Seyed Habib A. Rahmati & Abbas Ahmadi & Kannan Govindan, 2018. "A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach," Annals of Operations Research, Springer, vol. 269(1), pages 583-621, October.
    10. Jun Pei & Xinbao Liu & Panos M. Pardalos & Wenjuan Fan & Shanlin Yang, 2017. "Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times," Annals of Operations Research, Springer, vol. 249(1), pages 175-195, February.
    11. Wang, Ling & Sun, Lin-Yan & Sun, Lin-Hui & Wang, Ji-Bo, 2010. "On three-machine flow shop scheduling with deteriorating jobs," International Journal of Production Economics, Elsevier, vol. 125(1), pages 185-189, May.
    12. Mostafa Khatami & Amir Salehipour, 2021. "Coupled task scheduling with time-dependent processing times," Journal of Scheduling, Springer, vol. 24(2), pages 223-236, April.
    13. Wen-Hung Wu & Yunqiang Yin & T C E Cheng & Win-Chin Lin & Juei-Chao Chen & Shin-Yi Luo & Chin-Chia Wu, 2017. "A combined approach for two-agent scheduling with sum-of-processing-times-based learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(2), pages 111-120, February.
    14. Wu, Chin-Chia & Lee, Wen-Chiung, 2006. "Two-machine flowshop scheduling to minimize mean flow time under linear deterioration," International Journal of Production Economics, Elsevier, vol. 103(2), pages 572-584, October.
    15. Lodree Jr., Emmett J. & Geiger, Christopher D., 2010. "A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration," European Journal of Operational Research, Elsevier, vol. 201(2), pages 644-648, March.
    16. Mosheiov, Gur, 2012. "A note: Multi-machine scheduling with general position-based deterioration to minimize total load," International Journal of Production Economics, Elsevier, vol. 135(1), pages 523-525.
    17. Hongying Li & Chunjie Su, 2011. "An optimal semi-online algorithm for 2-machine scheduling with an availability constraint," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 153-165, August.
    18. Hnaien, Faicel & Yalaoui, Farouk & Mhadhbi, Ahmed, 2015. "Makespan minimization on a two-machine flowshop with an availability constraint on the first machine," International Journal of Production Economics, Elsevier, vol. 164(C), pages 95-104.
    19. Leung, Joseph Y.-T. & Ng, C.T. & Cheng, T.C. Edwin, 2008. "Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1090-1099, June.
    20. Imed Kacem & Hans Kellerer & Yann Lanuel, 2015. "Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 403-412, October.

    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:eee:ejores:v:180:y:2007:i:1:p:472-478. 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.