IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v45y1998i1p67-82.html
   My bibliography  Save this article

Scheduling to minimize the total compression and late costs

Author

Listed:
  • T.C.E. Cheng
  • Zhi‐Long Chen
  • Chung‐Lun Li
  • B.M.‐T. Lin

Abstract

We consider a single‐machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP‐hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near‐optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998

Suggested Citation

  • 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.
    • Handle: RePEc:wly:navres:v:45:y:1998:i:1:p:67-82
    DOI: 10.1002/(SICI)1520-6750(199802)45:13.0.CO;2-J
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1520-6750(199802)45:13.0.CO;2-J
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1520-6750(199802)45:13.0.CO;2-J?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
    ---><---

    References listed on IDEAS

    as
    1. Nowicki, Eugeniusz & Zdrzalka, Stanislaw, 1988. "A two-machine flow shop scheduling problem with controllable job processing times," European Journal of Operational Research, Elsevier, vol. 34(2), pages 208-220, March.
    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. 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.
    4. 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. Byung-Cheon Choi & Myoung-Ju Park, 2020. "Scheduling two projects with controllable processing times in a single-machine environment," Journal of Scheduling, Springer, vol. 23(5), pages 619-628, October.
    2. Geng, Zhichao & Yuan, Jinjiang, 2023. "Single-machine scheduling of multiple projects with controllable processing times," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1074-1090.
    3. Yim, Seho & Hong, Sung-Pil & Park, Myoung-Ju & Chung, Yerim, 2022. "Inverse interval scheduling via reduction on a single machine," European Journal of Operational Research, Elsevier, vol. 303(2), pages 541-549.
    4. Dujuan Wang & Yugang Yu & Huaxin Qiu & Yunqiang Yin & T. C. E. Cheng, 2020. "Two‐agent scheduling with linear resource‐dependent processing times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(7), pages 573-591, October.

    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. 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.
    2. 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.
    3. 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.
    4. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    5. 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.
    6. 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.
    7. Neppalli, Venkata Ranga & Chen, Chuen-Lung & Gupta, Jatinder N. D., 1996. "Genetic algorithms for the two-stage bicriteria flowshop problem," European Journal of Operational Research, Elsevier, vol. 95(2), pages 356-373, December.
    8. 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.
    9. Lee, Sang M. & Asllani, Arben A., 2004. "Job scheduling with dual criteria and sequence-dependent setups: mathematical versus genetic programming," Omega, Elsevier, vol. 32(2), pages 145-153, April.
    10. 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.
    11. 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.
    12. Biskup, Dirk, 1999. "Single-machine scheduling with learning considerations," European Journal of Operational Research, Elsevier, vol. 115(1), pages 173-178, May.
    13. Selvi, Omer & Gokbayrak, Kagan, 2010. "A search method for optimal control of a flow shop system of traditional machines," European Journal of Operational Research, Elsevier, vol. 205(2), pages 325-331, September.
    14. 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.
    15. Carrasco, Rodrigo A. & Iyengar, Garud & Stein, Cliff, 2018. "Resource cost aware scheduling," European Journal of Operational Research, Elsevier, vol. 269(2), pages 621-632.
    16. Nagar, Amit & Haddock, Jorge & Heragu, Sunderesh, 1995. "Multiple and bicriteria scheduling: A literature survey," European Journal of Operational Research, Elsevier, vol. 81(1), pages 88-104, February.
    17. Daniel Ng, C. T. & Cheng, T. C. Edwin & Kovalyov, Mikhail Y., 2004. "Single machine batch scheduling with jointly compressible setup and processing times," European Journal of Operational Research, Elsevier, vol. 153(1), pages 211-219, February.
    18. 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.
    19. 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.
    20. 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.

    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:wly:navres:v:45:y:1998:i:1:p:67-82. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.