IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v43y1996i2-3p107-113.html
   My bibliography  Save this article

Due-date assignment and single machine scheduling with compressible processing times

Author

Listed:
  • Cheng, T. C. E.
  • Oguz, C.
  • Qi, X. D.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:proeco:v:43:y:1996:i:2-3:p:107-113
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0925-5273(96)00041-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. Alidaee, Bahram & Ahmadian, Ahmad, 1993. "Two parallel machine sequencing problems involving controllable job processing times," European Journal of Operational Research, Elsevier, vol. 70(3), pages 335-341, November.
    2. 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.
    3. 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.
    4. S. S. Panwalkar & M. L. Smith & A. Seidmann, 1982. "Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem," Operations Research, INFORMS, vol. 30(2), pages 391-399, April.
    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. Cheng, T. C. E. & Gupta, M. C., 1989. "Survey of scheduling research involving due date determination decisions," European Journal of Operational Research, Elsevier, vol. 38(2), pages 156-166, January.
    7. 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. 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.
    2. Du-Juan Wang & Yunqiang Yin & Shuenn-Ren Cheng & T.C.E. Cheng & Chin-Chia Wu, 2016. "Due date assignment and scheduling on a single machine with two competing agents," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1152-1169, February.
    3. Cheng, T. C. E. & Ng, C. T. & Yuan, J. J. & Liu, Z. H., 2005. "Single machine scheduling to minimize total weighted tardiness," European Journal of Operational Research, Elsevier, vol. 165(2), pages 423-443, September.
    4. 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.
    5. Chun-Lai Liu & Jian-Jun Wang, 2016. "Unrelated Parallel-Machine Scheduling with Controllable Processing Times and Impact of Deteriorating Maintenance Activities under Consideration," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(01), pages 1-16, February.
    6. 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.
    7. Biskup, Dirk, 1999. "Single-machine scheduling with learning considerations," European Journal of Operational Research, Elsevier, vol. 115(1), pages 173-178, May.
    8. 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.
    9. 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.
    10. 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.
    11. Chang, Pei-Chann & Chen, Shih-Hsin & Mani, V., 2009. "A note on due-date assignment and single machine scheduling with a learning/aging effect," International Journal of Production Economics, Elsevier, vol. 117(1), pages 142-149, January.
    12. 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.
    13. 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.
    14. 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.
    15. Yedidsion, Liron & Shabtay, Dvir & Korach, Ephraim & Kaspi, Moshe, 2009. "A bicriteria approach to minimize number of tardy jobs and resource consumption in scheduling a single machine," International Journal of Production Economics, Elsevier, vol. 119(2), pages 298-307, June.
    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. 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.
    18. J-G Kim & D-H Lee, 2009. "Algorithms for common due-date assignment and sequencing on a single machine with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1264-1272, September.
    19. Min Ji & Sai Liu & Xiaolin Zhang & Keke Cao & T. C. E. Cheng, 2017. "Sequencing Games with Slack Due Windows and Group Technology Considerations," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(2), pages 121-133, February.
    20. 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.
    21. Mor, Baruch & Mosheiov, Gur, 2012. "Scheduling a maintenance activity and due-window assignment based on common flow allowance," International Journal of Production Economics, Elsevier, vol. 135(1), pages 222-230.

    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. Biskup, Dirk, 1999. "Single-machine scheduling with learning considerations," European Journal of Operational Research, Elsevier, vol. 115(1), pages 173-178, May.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    9. 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.
    10. 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.
    11. 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.
    12. Hui Zhu & Min Li & Zhangjin Zhou & Yun You, 2016. "Due-window assignment and scheduling with general position-dependent processing times involving a deteriorating and compressible maintenance activity," International Journal of Production Research, Taylor & Francis Journals, vol. 54(12), pages 3475-3490, June.
    13. 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.
    14. Prabuddha De & Jay B. Ghosh & Charles E. Wells, 1994. "Due‐date assignment and early/tardy scheduling on identical parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(1), pages 17-32, February.
    15. Philip Kaminsky & Onur Kaya, 2008. "Scheduling and due‐date quotation in a make‐to‐order supply chain," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(5), pages 444-458, August.
    16. 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.
    17. 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.
    18. Li, Shisheng & Ng, C.T. & Yuan, Jinjiang, 2011. "Group scheduling and due date assignment on a single machine," International Journal of Production Economics, Elsevier, vol. 130(2), pages 230-235, April.
    19. 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.
    20. Bernard Dickman & Yonah Wilamowsky & Sheldon Epstein, 2001. "Multiple common due dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(4), pages 293-298, June.

    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:43:y:1996:i:2-3:p:107-113. 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.