IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v10y2005i2d10.1007_s10878-005-2272-z.html
   My bibliography  Save this article

Efficient Job Scheduling Algorithms with Multi-Type Contentions

Author

Listed:
  • Zhenming Chen

    (State University of New York at Buffalo)

  • Vikas Singh

    (State University of New York at Buffalo)

  • Jinhui Xu

    (State University of New York at Buffalo)

Abstract

In this paper, we consider an interesting generalization of the classic job scheduling problem in which each job needs to compete not only for machines but also for other types of resources. The contentions among jobs for machines and for resources could interfere with each other, which complicates the problem dramatically. We present a family of approximation algorithms for solving several variants of the problem by using a generic algorithmic framework. Our algorithms achieve a constant approximation ratio (i.e., 3) when there is only one type of resources or certain dependency relation exists among multiple types of resources. When the r resources are unrelated, the approximation ratio of our algorithm becomes k+2, where k≤ r is a constant depending on the problem instance. As an application, we also show that our techniques can be easily applied to optical burst switching (OBS) networks to design more efficient wavelength scheduling algorithms.

Suggested Citation

  • Zhenming Chen & Vikas Singh & Jinhui Xu, 2005. "Efficient Job Scheduling Algorithms with Multi-Type Contentions," Journal of Combinatorial Optimization, Springer, vol. 10(2), pages 179-197, September.
    • Handle: RePEc:spr:jcomop:v:10:y:2005:i:2:d:10.1007_s10878-005-2272-z
    DOI: 10.1007/s10878-005-2272-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-005-2272-z
    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/s10878-005-2272-z?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. Hiroshi Kise & Toshihide Ibaraki & Hisashi Mine, 1978. "A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times," Operations Research, INFORMS, vol. 26(1), pages 121-126, 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. Baptiste, Philippe & Peridy, Laurent & Pinson, Eric, 2003. "A branch and bound to minimize the number of late jobs on a single machine with release time constraints," European Journal of Operational Research, Elsevier, vol. 144(1), pages 1-11, January.
    2. Federico Malucelli & Sara Nicoloso, 2007. "Shiftable intervals," Annals of Operations Research, Springer, vol. 150(1), pages 137-157, March.
    3. M'Hallah, Rym & Bulfin, R.L., 2007. "Minimizing the weighted number of tardy jobs on a single machine with release dates," European Journal of Operational Research, Elsevier, vol. 176(2), pages 727-744, January.
    4. Koulamas, Christos & Kyparisis, George J., 2001. "Single machine scheduling with release times, deadlines and tardiness objectives," European Journal of Operational Research, Elsevier, vol. 133(2), pages 447-453, January.
    5. Xiaoqiang Cai & Sean Zhou, 1999. "Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs," Operations Research, INFORMS, vol. 47(3), pages 422-437, June.
    6. Mosheiov, Gur & Sarig, Assaf, 2010. "Minimum weighted number of tardy jobs on an m-machine flow-shop with a critical machine," European Journal of Operational Research, Elsevier, vol. 201(2), pages 404-408, March.
    7. Gupta, Jatinder N. D. & Ho, Johnny C., 1996. "Scheduling with two job classes and setup times to minimize the number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 42(3), pages 205-216, April.
    8. Cai, X. & Lum, V. Y. S. & Chan, J. M. T., 1997. "Scheduling about a common due date with kob-dependent asymmetric earliness and tardiness penalties," European Journal of Operational Research, Elsevier, vol. 98(1), pages 154-168, April.
    9. Sevaux, Marc & Dauzere-Peres, Stephane, 2003. "Genetic algorithms to minimize the weighted number of late jobs on a single machine," European Journal of Operational Research, Elsevier, vol. 151(2), pages 296-306, December.
    10. Gio Kao & Edward Sewell & Sheldon Jacobson & Shane Hall, 2012. "New dominance rules and exploration strategies for the 1|r i |∑U i scheduling problem," Computational Optimization and Applications, Springer, vol. 51(3), pages 1253-1274, April.
    11. Detienne, Boris, 2014. "A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints," European Journal of Operational Research, Elsevier, vol. 235(3), pages 540-552.
    12. Leung, Joseph Y.-T. & Li, Haibing & Pinedo, Michael, 2006. "Scheduling orders for multiple product types with due date related objectives," European Journal of Operational Research, Elsevier, vol. 168(2), pages 370-389, January.
    13. Dauzere-Peres, Stephane, 1995. "Minimizing late jobs in the general one machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 81(1), pages 134-142, February.
    14. Sadykov, Ruslan, 2008. "A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1284-1304, September.
    15. Peridy, Laurent & Pinson, Eric & Rivreau, David, 2003. "Using short-term memory to minimize the weighted number of late jobs on a single machine," European Journal of Operational Research, Elsevier, vol. 148(3), pages 591-603, August.
    16. I. Adiri & E. Frostig & A. H. G. Rinnooy Kan, 1991. "Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(2), pages 261-271, April.
    17. François Clautiaux & Boris Detienne & Henri Lefebvre, 2023. "A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty," Journal of Scheduling, Springer, vol. 26(2), pages 169-191, April.
    18. Asano, Makoto & Ohta, Hiroshi, 1996. "Single machine scheduling using dominance relation to minimize earliness subject to ready and due times," International Journal of Production Economics, Elsevier, vol. 44(1-2), pages 35-43, June.
    19. Stéphane Dauzère‐Pérès & Marc Sevaux, 2003. "Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(3), pages 273-288, April.

    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:jcomop:v:10:y:2005:i:2:d:10.1007_s10878-005-2272-z. 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.