Skip to main content
SpringerLink
Log in

Single-machine scheduling with common due-window assignment for deteriorating jobs

  • General Paper
  • Published:
Journal of the Operational Research Society

Abstract

In this paper, we consider a single-machine common due-window assignment scheduling problem with deteriorating jobs. Jobs’ processing times are defined by function of their starting times and job-dependent deterioration rates that are related to jobs and are not all equal. The objective is to determine an optimal combination of sequence and common due-window location so as to minimize the weighted sum of earliness, tardiness and due-window location penalties. We propose an O(n2 log n) time algorithm to solve the problem and discuss several instances to illustrate it.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5

Similar content being viewed by others

References

  • Alidaee B and Womer NK (1999). Scheduling with time dependent processing times: Review and extensions. Journal of the Operational Research Society 50 (7): 711–729.

    Article  Google Scholar 

  • Browne S and Yechiali U (1990). Scheduling deteriorating jobs on a single processor. Operations Research 38 (3): 495–498.

    Article  Google Scholar 

  • Cheng TCE, Ding Q and Lin BMT (2004a). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research 152 (1): 1–13.

    Article  Google Scholar 

  • Cheng TCE, Kang L and Ng CT (2004b). Due-date assignment and single machine scheduling with deteriorating jobs. Journal of the Operational Research Society 55 (2): 198–203.

    Article  Google Scholar 

  • Cheng TCE, Wu CC and Lee WC (2008). Some scheduling problems with deteriorating jobs and learning effects. Computers & Industrial Engineering 54 (4): 972–982.

    Article  Google Scholar 

  • Gordon V, Proth JM and Chu C (2002). A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research 139 (1): 1–25.

    Article  Google Scholar 

  • Graham RL, Lawler EL, Lenstra JK and Rinnooy Kan AHG (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5 (2): 287–326.

    Article  Google Scholar 

  • Kuo WH and Yang DL (2008). A note on due-date assignment and single-machine scheduling with deteriorating jobs. Journal of the Operational Research Society 59 (6): 857–859.

    Article  Google Scholar 

  • Kuo WH and Yang DL (2011). A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effects. Journal of the Operational Research Society 62 (1): 206–210.

    Article  Google Scholar 

  • Liman SD, Panwalkar SS and Thongmee S (1996). Determination of common due window location in a single machine scheduling problem. European Journal of Operational Research 93 (1): 68–74.

    Article  Google Scholar 

  • Liman SD, Panwalkar SS and Thongmee S (1998). Common due window size and location determination in a single machine scheduling problem. Journal of the Operational Research Society 49 (9): 1007–1010.

    Article  Google Scholar 

  • Liu J and Min X (2010). Just-in-time on a single machine scheduling problem with deteriorating jobs. Journal of Zhejiang University (Chinese) 37 (1): 34–37.

    Google Scholar 

  • Mosheiov G (1994). Scheduling jobs under simple linear deterioration. Computers & Operations Research 21 (6): 653–659.

    Article  Google Scholar 

  • Mosheiov G and Oron D (2004). Due-window assignment with unit processing-time jobs. Naval Research Logistics 51 (7): 1005–1017.

    Article  Google Scholar 

  • Mosheiov G and Sarig A (2008). A due-window assignment problem with position-dependent processing times. Journal of the Operational Research Society 59 (7): 997–1003.

    Article  Google Scholar 

  • Panwalkar SS, Smith ML and Seidmann A (1982). Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research 30 (2): 391–399.

    Article  Google Scholar 

  • Pinedo M (2002). Scheduling Theory, Algorithms, and Systems. Prentice-Hall: New Jersey.

    Google Scholar 

  • Weng MX and Ventura JA (1994). Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times. Naval Research Logistics 41 (6): 843–851.

    Article  Google Scholar 

  • Weng MX and Ventura JA (1996). A note on ‘common due-window scheduling’. Production and Operations Management 5 (2): 194–200.

    Article  Google Scholar 

Download references

Acknowledgements

We are grateful to three anonymous referees for their helpful comments on an earlier version of the paper. This research was supported by the Science Research Project of the Educational Department of Zhejiang Province, China (No.Y201122447) and ZJNSF, China (No.LY12A01019, No.Y1111192).

Author information

Authors and Affiliations

  1. Jiaxing University, Zhejiang, China

    J Liu & X Min

  2. Shanghai International Studies University, Shanghai, China

    Y Wang

Authors
  1. J Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Y Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. X Min
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J Liu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, J., Wang, Y. & Min, X. Single-machine scheduling with common due-window assignment for deteriorating jobs. J Oper Res Soc 65, 291–301 (2014). https://doi.org/10.1057/jors.2013.6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.2013.6

Keywords

Search

Navigation