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

Optimal allocation and processing time decisions on non-identical parallel CNC machines: [epsilon]-constraint approach

Author

Listed:
  • Gurel, Sinan
  • Akturk, M. Selim

Abstract

No abstract is available for this item.

Suggested Citation

  • Gurel, Sinan & Akturk, M. Selim, 2007. "Optimal allocation and processing time decisions on non-identical parallel CNC machines: [epsilon]-constraint approach," European Journal of Operational Research, Elsevier, vol. 183(2), pages 591-607, December.
  • Handle: RePEc:eee:ejores:v:183:y:2007:i:2:p:591-607
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)01057-5
    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. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    2. Van Wassenhove, Luk N. & Baker, Kenneth R., 1982. "A bicriterion approach to time/cost trade-offs in sequencing," European Journal of Operational Research, Elsevier, vol. 11(1), pages 48-54, September.
    3. F Della Croce & V T'kindt, 2002. "A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(11), pages 1275-1280, November.
    4. Sodhi, Manbir S. & Lamond, Bernard F. & Gautier, Antoine & Noel, Martin, 2001. "Heuristics for determining economic processing rates in a flexible manufacturing system," European Journal of Operational Research, Elsevier, vol. 129(1), pages 105-115, February.
    5. Michael A. Trick, 1994. "Scheduling Multiple Variable-Speed Machines," Operations Research, INFORMS, vol. 42(2), pages 234-248, April.
    6. Kayan, Rabia K. & Akturk, M. Selim, 2005. "A new bounding mechanism for the CNC machine scheduling problems with controllable processing times," European Journal of Operational Research, Elsevier, vol. 167(3), pages 624-643, December.
    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. Körpeoglu, Ersin & Yaman, Hande & Selim Aktürk, M., 2011. "A multi-stage stochastic programming approach in master production scheduling," European Journal of Operational Research, Elsevier, vol. 213(1), pages 166-179, August.

    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. Dvir Shabtay & Moshe Kaspi, 2006. "Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(3), pages 204-216, April.
    2. Yaron Leyvand & Dvir Shabtay & George Steiner & Liron Yedidsion, 2010. "Just-in-time scheduling with controllable processing times on parallel machines," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 347-368, April.
    3. Shabtay, Dvir & Bensoussan, Yaron & Kaspi, Moshe, 2012. "A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system," International Journal of Production Economics, Elsevier, vol. 136(1), pages 67-74.
    4. 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.
    5. Jorge M. S. Valente, 2007. "Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs," FEP Working Papers 250, Universidade do Porto, Faculdade de Economia do Porto.
    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. Berghman, Lotte & Leus, Roel, 2015. "Practical solutions for a dock assignment problem with trailer transportation," European Journal of Operational Research, Elsevier, vol. 246(3), pages 787-799.
    8. R-H Huang & C-L Yang, 2009. "An algorithm for minimizing flow time and maximum earliness on a single machine," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(6), pages 873-877, June.
    9. Gurel, Sinan & Akturk, M. Selim, 2007. "Considering manufacturing cost and scheduling performance on a CNC turning machine," European Journal of Operational Research, Elsevier, vol. 177(1), pages 325-343, February.
    10. Dvir Shabtay & George Steiner, 2007. "Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine," Manufacturing & Service Operations Management, INFORMS, vol. 9(3), pages 332-350, March.
    11. J M S Valente, 2010. "Beam search heuristics for quadratic earliness and tardiness scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(4), pages 620-631, April.
    12. Richard L. Daniels & Joseph B. Mazzola & Dailun Shi, 2004. "Flow Shop Scheduling with Partial Resource Flexibility," Management Science, INFORMS, vol. 50(5), pages 658-669, May.
    13. David Fischer & Péter Györgyi, 2023. "Approximation algorithms for coupled task scheduling minimizing the sum of completion times," Annals of Operations Research, Springer, vol. 328(2), pages 1387-1408, September.
    14. Lingfa Lu & Liqi Zhang, 2023. "Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost," Journal of Combinatorial Optimization, Springer, vol. 46(1), pages 1-17, August.
    15. Chen, Bo & Zhang, Xiandong, 2019. "Scheduling with time-of-use costs," European Journal of Operational Research, Elsevier, vol. 274(3), pages 900-908.
    16. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    17. Yazdani Sabouni, M.T. & Logendran, Rasaratnam, 2013. "Carryover sequence-dependent group scheduling with the integration of internal and external setup times," European Journal of Operational Research, Elsevier, vol. 224(1), pages 8-22.
    18. Chung‐Lun Li & Edward C. Sewell & T. C. E. Cheng, 1995. "Scheduling to minimize release‐time resource consumption and tardiness penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 949-966, September.
    19. D Petrovic & O Aköz, 2008. "A fuzzy goal programming approach to integrated loading and scheduling of a batch processing machine," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1211-1219, September.
    20. 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.

    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:183:y:2007:i:2:p:591-607. 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.