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

Scheduling with controllable release dates and processing times: Total completion time minimization

Author

Listed:
  • Cheng, T.C. Edwin
  • Kovalyov, Mikhail Y.
  • Shakhlevich, Natalia V.

Abstract

No abstract is available for this item.

Suggested Citation

  • Cheng, T.C. Edwin & Kovalyov, Mikhail Y. & Shakhlevich, Natalia V., 2006. "Scheduling with controllable release dates and processing times: Total completion time minimization," European Journal of Operational Research, Elsevier, vol. 175(2), pages 769-781, December.
    • Handle: RePEc:eee:ejores:v:175:y:2006:i:2:p:769-781
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00047-6
    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. Surya Liman & Shrikant Panwalkar & Sansern Thongmee, 1997. "A single machine scheduling problem with common due window and controllable processing times," Annals of Operations Research, Springer, vol. 70(0), pages 145-154, April.
    2. Janiak, Adam, 1991. "Single machine scheduling problem with a common deadline and resource dependent release dates," European Journal of Operational Research, Elsevier, vol. 53(3), pages 317-325, August.
    3. Hoogeveen, J. A. & van de Velde, S. L., 1991. "Scheduling around a small common due date," European Journal of Operational Research, Elsevier, vol. 55(2), pages 237-242, November.
    4. Janiak, Adam & Kovalyov, Mikhail Y., 1996. "Single machine scheduling subject to deadlines and resource dependent processing times," European Journal of Operational Research, Elsevier, vol. 94(2), pages 284-291, October.
    5. Janiak, Adam, 1998. "Minimization of the makespan in a two-machine problem under given resource constraints," European Journal of Operational Research, Elsevier, vol. 107(2), pages 325-337, June.
    6. 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.
    7. Li, Chung-Lun, 1995. "Scheduling to minimize the total resource consumption with a constraint on the sum of completion times," European Journal of Operational Research, Elsevier, vol. 80(2), pages 381-388, January.
    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(1), pages 29-35, May.
    9. Nicholas G. Hall & Wieslaw Kubiak & Suresh P. Sethi, 1991. "Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 847-856, October.
    10. 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.
    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. Faramroze G. Engineer & George L. Nemhauser & Martin W. P. Savelsbergh & Jin-Hwa Song, 2012. "The Fixed-Charge Shortest-Path Problem," INFORMS Journal on Computing, INFORMS, vol. 24(4), pages 578-596, November.
    2. Yuri N. Sotskov & Natalja M. Matsveichuk & Vadzim D. Hatsura, 2020. "Schedule Execution for Two-Machine Job-Shop to Minimize Makespan with Uncertain Processing Times," Mathematics, MDPI, vol. 8(8), pages 1-51, August.
    3. Evgeny Gurevsky & Sergey Kovalev & Mikhail Y. Kovalyov, 2021. "Min-max controllable risk problems," 4OR, Springer, vol. 19(1), pages 93-101, March.
    4. 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.
    5. 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. 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.
    2. Gordon, Valery & Proth, Jean-Marie & Chu, Chengbin, 2002. "A survey of the state-of-the-art of common due date assignment and scheduling research," European Journal of Operational Research, Elsevier, vol. 139(1), pages 1-25, May.
    3. Shabtay, Dvir & Steiner, George & Zhang, Rui, 2016. "Optimal coordination of resource allocation, due date assignment and scheduling decisions," Omega, Elsevier, vol. 65(C), pages 41-54.
    4. Koulamas, Christos & Gupta, Sushil & Kyparisis, George J., 2010. "A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times," European Journal of Operational Research, Elsevier, vol. 205(2), pages 479-482, September.
    5. Cheng, T.C. Edwin & Kovalyov, Mikhail Y. & Shakhlevich, Natalia V., 2006. "Scheduling with controllable release dates and processing times: Makespan minimization," European Journal of Operational Research, Elsevier, vol. 175(2), pages 751-768, December.
    6. Dvir Shabtay & George Steiner, 2008. "The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times," Annals of Operations Research, Springer, vol. 159(1), pages 25-40, March.
    7. 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.
    8. Ventura, Jose A. & Kim, Daecheol & Garriga, Frederic, 2002. "Single machine earliness-tardiness scheduling with resource-dependent release dates," European Journal of Operational Research, Elsevier, vol. 142(1), pages 52-69, October.
    9. 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.
    10. 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.
    11. Biskup, Dirk & Feldmann, Martin, 2005. "On scheduling around large restrictive common due windows," European Journal of Operational Research, Elsevier, vol. 162(3), pages 740-761, May.
    12. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    13. 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.
    14. Biskup, Dirk, 1999. "Single-machine scheduling with learning considerations," European Journal of Operational Research, Elsevier, vol. 115(1), pages 173-178, May.
    15. Shabtay, Dvir & Kaspi, Moshe, 2006. "Parallel machine scheduling with a convex resource consumption function," European Journal of Operational Research, Elsevier, vol. 173(1), pages 92-107, August.
    16. Dvir Shabtay, 2023. "A new perspective on single-machine scheduling problems with late work related criteria," Annals of Operations Research, Springer, vol. 322(2), pages 947-966, March.
    17. Janiak, Adam & Kovalyov, Mikhail Y. & Portmann, Marie-Claude, 2005. "Single machine group scheduling with resource dependent setup and processing times," European Journal of Operational Research, Elsevier, vol. 162(1), pages 112-121, April.
    18. 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.
    19. Cheng, T. C. Edwin & Janiak, Adam & Kovalyov, Mikhail Y., 2001. "Single machine batch scheduling with resource dependent setup and processing times," European Journal of Operational Research, Elsevier, vol. 135(1), pages 177-183, November.
    20. 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.

    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:175:y:2006:i:2:p:769-781. 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.