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

A new bounding mechanism for the CNC machine scheduling problems with controllable processing times

Author

Listed:
  • Kayan, Rabia K.
  • Akturk, M. Selim

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:167:y:2005:i:3:p:624-643
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00469-2
    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. Akturk, M. Selim & Avci, Selcuk, 1996. "Tool allocation and machining conditions optimization for CNC machines," European Journal of Operational Research, Elsevier, vol. 94(2), pages 335-348, October.
    2. B. Malakooti & J. Deviprasad, 1989. "An Interactive Multiple Criteria Approach for Parameter Selection in Metal Cutting," Operations Research, INFORMS, vol. 37(5), pages 805-818, October.
    3. Michael A. Trick, 1994. "Scheduling Multiple Variable-Speed Machines," Operations Research, INFORMS, vol. 42(2), pages 234-248, April.
    4. Richard L. Daniels & Barbara J. Hoopes & Joseph B. Mazzola, 1996. "Scheduling Parallel Manufacturing Cells with Resource Flexibility," Management Science, INFORMS, vol. 42(9), pages 1260-1276, September.
    5. Panwalkar, S. S. & Rajagopalan, R., 1992. "Single-machine sequencing with controllable processing times," European Journal of Operational Research, Elsevier, vol. 59(2), pages 298-302, June.
    6. R. G. Vickson, 1980. "Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine," Operations Research, INFORMS, vol. 28(5), pages 1155-1167, 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. 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.
    2. 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.
    3. 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.
    4. Fateme Akhoondi & M.M. Lotfi, 2016. "A heuristic algorithm for master production scheduling problem with controllable processing times and scenario-based demands," International Journal of Production Research, Taylor & Francis Journals, vol. 54(12), pages 3659-3676, June.
    5. Koca, Esra & Yaman, Hande & Selim Aktürk, M., 2015. "Stochastic lot sizing problem with controllable processing times," Omega, Elsevier, vol. 53(C), pages 1-10.
    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. 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.
    8. 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.
    9. 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.
    10. 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.

    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. 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.
    2. Leyvand, Yaron & Shabtay, Dvir & Steiner, George, 2010. "A unified approach for scheduling with convex resource consumption functions using positional penalties," European Journal of Operational Research, Elsevier, vol. 206(2), pages 301-312, October.
    3. Jansen, Klaus & Mastrolilli, Monaldo & Solis-Oba, Roberto, 2005. "Approximation schemes for job shop scheduling problems with controllable processing times," European Journal of Operational Research, Elsevier, vol. 167(2), pages 297-319, December.
    4. Cheng, T. C. E. & Oguz, C. & Qi, X. D., 1996. "Due-date assignment and single machine scheduling with compressible processing times," International Journal of Production Economics, Elsevier, vol. 43(1), pages 29-35, May.
    5. Wang, Ji-Bo & Xia, Zun-Quan, 2007. "Single machine scheduling problems with controllable processing times and total absolute differences penalties," European Journal of Operational Research, Elsevier, vol. 177(1), pages 638-645, February.
    6. T.C.E. Cheng & Zhi‐Long Chen & Chung‐Lun Li & B.M.‐T. Lin, 1998. "Scheduling to minimize the total compression and late costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(1), pages 67-82, February.
    7. Biskup, Dirk & Jahnke, Hermann, 2001. "Common due date assignment for scheduling on a single machine with jointly reducible processing times," International Journal of Production Economics, Elsevier, vol. 69(3), pages 317-322, February.
    8. Cheng, T. C. E. & Oguz, C. & Qi, X. D., 1996. "Due-date assignment and single machine scheduling with compressible processing times," International Journal of Production Economics, Elsevier, vol. 43(2-3), pages 107-113, June.
    9. Biskup, Dirk, 1999. "Single-machine scheduling with learning considerations," European Journal of Operational Research, Elsevier, vol. 115(1), pages 173-178, May.
    10. Wang, Xiuli & Cheng, T. C. E., 2005. "Single machine scheduling with resource dependent release times and processing times," European Journal of Operational Research, Elsevier, vol. 162(3), pages 727-739, May.
    11. 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.
    12. Liu Guiqing & Li Kai & Cheng Bayi, 2015. "Preemptive Scheduling with Controllable Processing Times on Parallel Machines," Journal of Systems Science and Information, De Gruyter, vol. 3(1), pages 68-76, February.
    13. Ali Kordmostafapour & Javad Rezaeian & Iraj Mahdavi & Mahdi Yar Farjad, 2022. "Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1438-1470, December.
    14. Bürgy, Reinhard & Bülbül, Kerem, 2018. "The job shop scheduling problem with convex costs," European Journal of Operational Research, Elsevier, vol. 268(1), pages 82-100.
    15. Norelhouda Sekkal & Fayçal Belkaid, 0. "A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-37.
    16. Adamopoulos, George I. & Pappis, Costas P., 1998. "Scheduling under a common due-data on parallel unrelated machines," European Journal of Operational Research, Elsevier, vol. 105(3), pages 494-501, March.
    17. M. Selim Akturk & Jay B. Ghosh & Evrim D. Gunes, 2003. "Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(1), pages 15-30, February.
    18. Bahram Alidaee & Haibo Wang & R. Bryan Kethley & Frank Landram, 2019. "A unified view of parallel machine scheduling with interdependent processing rates," Journal of Scheduling, Springer, vol. 22(5), pages 499-515, October.
    19. Wan, Guohua & Vakati, Sudheer R. & Leung, Joseph Y.-T. & Pinedo, Michael, 2010. "Scheduling two agents with controllable processing times," European Journal of Operational Research, Elsevier, vol. 205(3), pages 528-539, September.
    20. Edis, Emrah B. & Oguz, Ceyda & Ozkarahan, Irem, 2013. "Parallel machine scheduling with additional resources: Notation, classification, models and solution methods," European Journal of Operational Research, Elsevier, vol. 230(3), pages 449-463.

    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:167:y:2005:i:3:p:624-643. 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.