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

An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints

Author

Listed:
  • Sadfi, Cherif
  • Penz, Bernard
  • Rapine, Christophe
  • Blazewicz, Jacek
  • Formanowicz, Piotr

Abstract

No abstract is available for this item.

Suggested Citation

  • Sadfi, Cherif & Penz, Bernard & Rapine, Christophe & Blazewicz, Jacek & Formanowicz, Piotr, 2005. "An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints," European Journal of Operational Research, Elsevier, vol. 161(1), pages 3-10, February.
    • Handle: RePEc:eee:ejores:v:161:y:2005:i:1:p:3-10
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00529-0
    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.
    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. Kacem, Imed & Chu, Chengbin, 2008. "Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint," International Journal of Production Economics, Elsevier, vol. 112(1), pages 138-150, March.
    2. Kellerer, Hans & Kubzin, Mikhail A. & Strusevich, Vitaly A., 2009. "Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval," European Journal of Operational Research, Elsevier, vol. 199(1), pages 111-116, November.
    3. Tan, Zhiyi & Chen, Yong & Zhang, An, 2011. "Parallel machines scheduling with machine maintenance for minsum criteria," European Journal of Operational Research, Elsevier, vol. 212(2), pages 287-292, July.
    4. Shi-Sheng Li & Ren-Xia Chen, 2022. "Minimizing total weighted late work on a single-machine with non-availability intervals," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1330-1355, September.
    5. Breit, Joachim, 2007. "Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint," European Journal of Operational Research, Elsevier, vol. 183(2), pages 516-524, December.
    6. Shabtay, Dvir & Zofi, Moshe, 2018. "Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 198(C), pages 191-200.
    7. Jing Fan & Xiwen Lu, 2015. "Supply chain scheduling problem in the hospital with periodic working time on a single machine," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 892-905, November.
    8. Mellouli, Racem & Sadfi, Chrif & Chu, Chengbin & Kacem, Imed, 2009. "Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times," European Journal of Operational Research, Elsevier, vol. 197(3), pages 1150-1165, September.
    9. Yunqiang Yin & Jianyou Xu & T. C. E. Cheng & Chin‐Chia Wu & Du‐Juan Wang, 2016. "Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(2), pages 172-183, March.
    10. Kacem, Imed & Chu, Chengbin, 2008. "Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1080-1089, June.
    11. Shabtay, Dvir, 2022. "Single-machine scheduling with machine unavailability periods and resource dependent processing times," European Journal of Operational Research, Elsevier, vol. 296(2), pages 423-439.
    12. Hanane Krim & Rachid Benmansour & David Duvivier & Daoud Aït-Kadi & Said Hanafi, 2020. "Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance," Computational Optimization and Applications, Springer, vol. 75(1), pages 291-320, January.
    13. Zhenpeng Li & Congdian Cheng, 2023. "The Expected Competitive Ratio on a Kind of Stochastic-Online Flowtime Scheduling with Machine Subject to an Uncertain Breakdown," Mathematics, MDPI, vol. 11(11), pages 1-12, May.
    14. Tan, Zhiyi & Chen, Yong & Zhang, An, 2013. "On the exact bounds of SPT for scheduling on parallel machines with availability constraints," International Journal of Production Economics, Elsevier, vol. 146(1), pages 293-299.
    15. Hans Kellerer & Vitaly A. Strusevich, 2016. "Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications," Annals of Operations Research, Springer, vol. 240(1), pages 39-94, May.
    16. Sandeep Kumar & Bhupesh Kumar Lad, 2017. "Integrated production and maintenance planning for parallel machine system considering cost of rejection," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(7), pages 834-846, July.

    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. 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.
    2. 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.
    3. Allaoui, H. & Lamouri, S. & Artiba, A. & Aghezzaf, E., 2008. "Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 112(1), pages 161-167, March.
    4. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    5. 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.
    6. Shabtay, Dvir, 2022. "Single-machine scheduling with machine unavailability periods and resource dependent processing times," European Journal of Operational Research, Elsevier, vol. 296(2), pages 423-439.
    7. 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.
    8. 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.
    9. Huo, Yumei & Zhao, Hairong, 2015. "Total completion time minimization on multiple machines subject to machine availability and makespan constraints," European Journal of Operational Research, Elsevier, vol. 243(2), pages 547-554.
    10. Zribi, N. & El Kamel, A. & Borne, P., 2008. "Minimizing the makespan for the MPM job-shop with availability constraints," International Journal of Production Economics, Elsevier, vol. 112(1), pages 151-160, March.
    11. 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.
    12. Liao, Ching-Jong & Shyur, Der-Lin & Lin, Chien-Hung, 2005. "Makespan minimization for two parallel machines with an availability constraint," European Journal of Operational Research, Elsevier, vol. 160(2), pages 445-456, January.
    13. Geurtsen, M. & Didden, Jeroen B.H.C. & Adan, J. & Atan, Z. & Adan, I., 2023. "Production, maintenance and resource scheduling: A review," European Journal of Operational Research, Elsevier, vol. 305(2), pages 501-529.
    14. Shabtay, Dvir & Zofi, Moshe, 2018. "Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 198(C), pages 191-200.
    15. Xu, Dehua & Wan, Long & Liu, Aihua & Yang, Dar-Li, 2015. "Single machine total completion time scheduling problem with workload-dependent maintenance duration," Omega, Elsevier, vol. 52(C), pages 101-106.
    16. 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.
    17. Kerem Bülbül & Safia Kedad-Sidhoum & Halil Şen, 2019. "Single-machine common due date total earliness/tardiness scheduling with machine unavailability," Journal of Scheduling, Springer, vol. 22(5), pages 543-565, October.
    18. Liao, Lu-Wen & Sheen, Gwo-Ji, 2008. "Parallel machine scheduling with machine availability and eligibility constraints," European Journal of Operational Research, Elsevier, vol. 184(2), pages 458-467, January.
    19. Imed Kacem, 2009. "Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval," Journal of Combinatorial Optimization, Springer, vol. 17(2), pages 117-133, February.
    20. Huo, Yumei & Zhao, Hairong, 2018. "Two machine scheduling subject to arbitrary machine availability constraint," Omega, Elsevier, vol. 76(C), pages 128-136.

    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:161:y:2005:i:1:p:3-10. 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.