IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v103y2006i2p810-825.html
   My bibliography  Save this article

Generating Pareto schedules with outsource and internal parallel resources

Author

Listed:
  • Ruiz-Torres, Alex J.
  • Ho, Johnny C.
  • Lopez, Francisco J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Ruiz-Torres, Alex J. & Ho, Johnny C. & Lopez, Francisco J., 2006. "Generating Pareto schedules with outsource and internal parallel resources," International Journal of Production Economics, Elsevier, vol. 103(2), pages 810-825, October.
    • Handle: RePEc:eee:proeco:v:103:y:2006:i:2:p:810-825
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(06)00103-4
    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. Dominique Deprins & Léopold Simar & Henry Tulkens, 2006. "Measuring Labor-Efficiency in Post Offices," Springer Books, in: Parkash Chander & Jacques Drèze & C. Knox Lovell & Jack Mintz (ed.), Public goods, environmental externalities and fiscal competition, chapter 0, pages 285-309, Springer.
    2. de Kok, Ton G., 2000. "Capacity allocation and outsourcing in a process industry," International Journal of Production Economics, Elsevier, vol. 68(3), pages 229-239, December.
    3. Gupta, J.N.D. & Ruiz-Torres, Alex J., 2005. "Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs," European Journal of Operational Research, Elsevier, vol. 167(3), pages 679-695, December.
    4. McCarthy, Ian & Anagnostou, Angela, 2004. "The impact of outsourcing on the transaction costs and boundaries of manufacturing," International Journal of Production Economics, Elsevier, vol. 88(1), pages 61-71, March.
    5. J. Michael Moore, 1968. "An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs," Management Science, INFORMS, vol. 15(1), pages 102-109, September.
    6. Tukel, Oya Icmeli & Wasti, S. Nazli, 2001. "Analysis of supplier buyer relationships using resource constrained project scheduling strategies," European Journal of Operational Research, Elsevier, vol. 129(2), pages 271-276, March.
    7. Ho, Johnny C. & Chang, Yih-Long, 1995. "Minimizing the number of tardy jobs for m parallel machines," European Journal of Operational Research, Elsevier, vol. 84(2), pages 343-355, July.
    8. M'Hallah, Rym & Bulfin, R. L., 2005. "Minimizing the weighted number of tardy jobs on parallel processors," European Journal of Operational Research, Elsevier, vol. 160(2), pages 471-484, January.
    9. James R. Bradley, 2004. "A Brownian Approximation of a Production-Inventory System with a Manufacturer That Subcontracts," Operations Research, INFORMS, vol. 52(5), pages 765-784, October.
    10. Chen, Chuen-Lung & Bulfin, Robert L., 1993. "Complexity of single machine, multi-criteria scheduling problems," European Journal of Operational Research, Elsevier, vol. 70(1), pages 115-125, October.
    11. Kim, Bowon, 2003. "Dynamic outsourcing to contract manufacturers with different capabilities of reducing the supply cost," International Journal of Production Economics, Elsevier, vol. 86(1), pages 63-80, October.
    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. Baoyu Liao & Qingru Song & Jun Pei & Shanlin Yang & Panos M. Pardalos, 2020. "Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration," Journal of Global Optimization, Springer, vol. 78(4), pages 717-742, December.
    2. Lee, Kangbok & Choi, Byung-Cheon, 2011. "Two-stage production scheduling with an outsourcing option," European Journal of Operational Research, Elsevier, vol. 213(3), pages 489-497, 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. Erenay, Fatih Safa & Sabuncuoglu, Ihsan & Toptal, Aysegül & Tiwari, Manoj Kumar, 2010. "New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 201(1), pages 89-98, February.
    2. Ruiz-Torres, Alex J. & Lopez, Francisco J. & Ho, Johnny C., 2007. "Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 179(2), pages 302-315, June.
    3. Briskorn, Dirk & Waldherr, Stefan, 2022. "Anarchy in the UJ: Coordination mechanisms for minimizing the number of late jobs," European Journal of Operational Research, Elsevier, vol. 301(3), pages 815-827.
    4. A J Ruiz-Torres & F J López & P J Wojciechowski & J C Ho, 2010. "Parallel machine scheduling problems considering regular measures of performance and machine cost," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(5), pages 849-857, May.
    5. 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.
    6. 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.
    7. Chen, Bo & Zhang, Xiandong, 2019. "Scheduling with time-of-use costs," European Journal of Operational Research, Elsevier, vol. 274(3), pages 900-908.
    8. Bornstein, Claudio Thomas & Alcoforado, Luciane Ferreira & Maculan, Nelson, 2005. "A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem," European Journal of Operational Research, Elsevier, vol. 165(3), pages 649-656, September.
    9. Pun, Hubert, 2014. "Supplier selection of a critical component when the production process can be improved," International Journal of Production Economics, Elsevier, vol. 154(C), pages 127-135.
    10. M'Hallah, Rym & Bulfin, R. L., 2005. "Minimizing the weighted number of tardy jobs on parallel processors," European Journal of Operational Research, Elsevier, vol. 160(2), pages 471-484, January.
    11. Koksalan, Murat & Burak Keha, Ahmet, 2003. "Using genetic algorithms for single-machine bicriteria scheduling problems," European Journal of Operational Research, Elsevier, vol. 145(3), pages 543-556, March.
    12. Hsieh, Chung-Chi & Wu, Cheng-Han, 2008. "Capacity allocation, ordering, and pricing decisions in a supply chain with demand and supply uncertainties," European Journal of Operational Research, Elsevier, vol. 184(2), pages 667-684, January.
    13. Hsiao, H.I. & Kemp, R.G.M. & van der Vorst, J.G.A.J. & (Onno) Omta, S.W.F., 2010. "A classification of logistic outsourcing levels and their impact on service performance: Evidence from the food processing industry," International Journal of Production Economics, Elsevier, vol. 124(1), pages 75-86, March.
    14. Gupta, J.N.D. & Ruiz-Torres, Alex J., 2005. "Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs," European Journal of Operational Research, Elsevier, vol. 167(3), pages 679-695, December.
    15. Huo, Yumei & Leung, Joseph Y.-T. & Zhao, Hairong, 2007. "Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness," European Journal of Operational Research, Elsevier, vol. 177(1), pages 116-134, February.
    16. J N D Gupta & A J Ruiz-torres & S Webster, 2003. "Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(12), pages 1263-1274, December.
    17. Koksalan Kondakci, Suna & Bekiroglu, Tuncay, 1997. "Scheduling with bicriteria: total flowtime and number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 53(1), pages 91-99, November.
    18. Kristiaan Kerstens & Ignace Van de Woestyne, 2018. "Enumeration algorithms for FDH directional distance functions under different returns to scale assumptions," Annals of Operations Research, Springer, vol. 271(2), pages 1067-1078, December.
    19. Ben-Daya, M. & Duffuaa, S. O. & Raouf, A., 1996. "Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine," European Journal of Operational Research, Elsevier, vol. 89(1), pages 100-107, February.
    20. Ravelojaona, Paola, 2019. "On constant elasticity of substitution – Constant elasticity of transformation Directional Distance Functions," European Journal of Operational Research, Elsevier, vol. 272(2), pages 780-791.

    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:proeco:v:103:y:2006:i:2:p:810-825. 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/ijpe .

    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.