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

Approximability of single machine scheduling with fixed jobs to minimize total completion time

Author

Listed:
  • Yuan, J.J.
  • Lin, Y.X.
  • Ng, C.T.
  • Cheng, T.C.E.

Abstract

No abstract is available for this item.

Suggested Citation

  • Yuan, J.J. & Lin, Y.X. & Ng, C.T. & Cheng, T.C.E., 2007. "Approximability of single machine scheduling with fixed jobs to minimize total completion time," European Journal of Operational Research, Elsevier, vol. 178(1), pages 46-56, April.
    • Handle: RePEc:eee:ejores:v:178:y:2007:i:1:p:46-56
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00060-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. J. K. Lenstra & A. H. G. Rinnooy Kan, 1978. "Complexity of Scheduling under Precedence Constraints," Operations Research, INFORMS, vol. 26(1), pages 22-35, February.
    2. Linus Schrage, 1968. "Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline," Operations Research, INFORMS, vol. 16(3), pages 687-690, June.
    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. Lin Chen & Nicole Megow & Roman Rischke & Leen Stougie & José Verschae, 2021. "Optimal algorithms for scheduling under time-of-use tariffs," Annals of Operations Research, Springer, vol. 304(1), pages 85-107, September.

    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. Thomas Kittsteiner & Benny Moldovanu, 2005. "Priority Auctions and Queue Disciplines That Depend on Processing Time," Management Science, INFORMS, vol. 51(2), pages 236-248, February.
    2. Samuli Aalto, 2006. "M/G/1/MLPS compared with M/G/1/PS within service time distribution class IMRL," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(2), pages 309-325, October.
    3. Ravindran Vijayalakshmi, Vipin & Schröder, Marc & Tamir, Tami, 2024. "Minimizing total completion time with machine-dependent priority lists," European Journal of Operational Research, Elsevier, vol. 315(3), pages 844-854.
    4. Mor Harchol-Balter, 2021. "Open problems in queueing theory inspired by datacenter computing," Queueing Systems: Theory and Applications, Springer, vol. 97(1), pages 3-37, February.
    5. Yan Zhao & Liping Chen & Gang Xie & Jianjun Zhao & Jianwan Ding, 2018. "GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 293-317, January.
    6. Jiang, Xiaojuan & Lee, Kangbok & Pinedo, Michael L., 2021. "Ideal schedules in parallel machine settings," European Journal of Operational Research, Elsevier, vol. 290(2), pages 422-434.
    7. Chengbin Chu, 1992. "A branch‐and‐bound algorithm to minimize total tardiness with different release dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 265-283, March.
    8. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "An Introduction To Multiprocessor Scheduling," Econometric Institute Archives 272258, Erasmus University Rotterdam.
    9. Luca Becchetti & Stefano Leonardi & Alberto Marchetti-Spaccamela & Guido Schäfer & Tjark Vredeveld, 2006. "Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm," Mathematics of Operations Research, INFORMS, vol. 31(1), pages 85-108, February.
    10. Samuli Aalto & Pasi Lassila & Prajwal Osti, 2016. "Whittle index approach to size-aware scheduling for time-varying channels with multiple states," Queueing Systems: Theory and Applications, Springer, vol. 83(3), pages 195-225, August.
    11. Katarina Cechlarova & Bettina Klaus & David F.Manlove, 2018. "Pareto optimal matchings of students to courses in the presence of prerequisites," Cahiers de Recherches Economiques du Département d'économie 16.04, Université de Lausanne, Faculté des HEC, Département d’économie.
    12. Nikhil Bansal & Bart Kamphorst & Bert Zwart, 2018. "Achievable Performance of Blind Policies in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 949-964, August.
    13. Rouba Ibrahim, 2022. "Personalized scheduling in service systems," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 445-447, April.
    14. Ahadi, Khatereh & Sullivan, Kelly M. & Mitchell, Kenneth Ned, 2018. "Budgeting maintenance dredging projects under uncertainty to improve the inland waterway network performance," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 119(C), pages 63-87.
    15. Christoph Ambühl & Monaldo Mastrolilli & Nikolaus Mutsanas & Ola Svensson, 2011. "On the Approximability of Single-Machine Scheduling with Precedence Constraints," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 653-669, November.
    16. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.
    17. Erhun Özkan & Amy R. Ward, 2019. "On the Control of Fork-Join Networks," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 532-564, May.
    18. Ntuen, Celestine A. & Park, Eui H., 1995. "An experiment in scheduling and planning of non-structured jobs: Lessons learned from artificial intelligence and operational research toolbox," European Journal of Operational Research, Elsevier, vol. 84(1), pages 96-115, July.
    19. Zeifman, A.I. & Razumchik, R.V. & Satin, Y.A. & Kovalev, I.A., 2021. "Ergodicity bounds for the Markovian queue with time-varying transition intensities, batch arrivals and one queue skipping policy," Applied Mathematics and Computation, Elsevier, vol. 395(C).
    20. Markó Horváth & Tamás Kis, 2020. "Polyhedral results for position-based scheduling of chains on a single machine," Annals of Operations Research, Springer, vol. 284(1), pages 283-322, January.

    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:178:y:2007:i:1:p:46-56. 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.