Skip to main content
SpringerLink
Log in

Unbounded batch scheduling with a common due window on a single machine*

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

The common due window scheduling problem with batching on a single machine is dealt with to minimize the total penalty of weighted earliness and tardiness. In this paper it is assumed that a job incurs no penalty as long as it is completed within the common due window. It is the first time for the due window scheduling to be extended to this situation so that jobs can be processed in batches. An unbounded version of batch scheduling is also considered. Hence, jobs, no matter how many there are, can be processed in a batch once the machine is free. For two cases that the location of due window is either a decision variable or a given parameter, polynomial algorithms are proposed based on several optimal properties.

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

Similar content being viewed by others

References

  1. F. D. Anger, C. Y. Lee, and L. A. Martin-Vega, Single machine scheduling with tight windows, Research report 86–16, Industrial and Systems Engineering Department, University of Florida, Gainesville, 1986.

  2. F. J. Krämer and C. Y. Lee, Common due-window scheduling, Production and Operations Management, 1993, 2(4): 262–275.

    Google Scholar 

  3. M. X. Weng and J. A. Ventura, A note on “common due window scheduling”, Production and Operations Management, 1996, 5(2): 194–200.

    Google Scholar 

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

    Article  Google Scholar 

  5. A. Janiak and M. Winczaszek, An optimal algorithm for a single processor scheduling problem with a common due window, in Proceedings of 9th IEEE International Conference on Methods and Models in Automation and Robotics, Miedzyzdroje, Poland, 2003, 1213–1216.

  6. A. Janiak and M. Winczaszek, A single processor scheduling problem with a common due window assignment, in Operations Research Proceedings 2004, Selected Papers of the International Conference on Operations Research (OR 2004), Tilburg, the Netherlands, 2004, 213–220.

  7. F. J. Krämer and C. Y. Lee, Due window scheduling for parallel machines, Mathematical and Computer Modelling, 1994, 20(2): 69–89.

    Article  Google Scholar 

  8. Z. L. Chen and C. Y. Lee, Parallel machine scheduling with a common due window, European Journal of Operational Research, 2002, 136(3): 512–527.

    Article  Google Scholar 

  9. A. Janiak and M. Winczaszek, Common due window assignment in parallel processor scheduling problem with nonlinear penalty functions, Lecture Notes in Computer Science, 2006, 3911: 132–139.

    Article  Google Scholar 

  10. C. N. Potts and L. N. V. Wassenhove, Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity, Journal of the Operational Research Society, 1992, 43(5): 395–406.

    Article  Google Scholar 

  11. C. N. Potts and M. Y. Kovalyov, Scheduling with batching: A review, European Journal of Operational Research, 2000, 120(2): 228–249.

    Article  Google Scholar 

  12. P. Brucker, A. Gladky, H. Hoogeveen, M. Y. Kovalyov, C. N. Potts, T. Tautenhahn, and S. L. van de Velde, Scheduling a batching machine, Journal of Scheduling, 1998, 1(1): 31–54.

    Article  Google Scholar 

  13. P. Carrica, P. D. Marco, W. Grassi, D. Chen, S. Li, and G. Tang, Single machine scheduling with common due date assignment in a group technology environment, Mathematical and Computer Modelling, 1997, 25(3): 81–90.

    Article  Google Scholar 

  14. S. van Hoesel, A. Wagelmans, and B. Moerman, Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions, European Journal of Operational Research, 1994, 75(2): 312–331.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Shandong Jianzhu University, Jinan, 250101, China

    Hongluan ZHAO

  2. School of Mathematics and System Science, Shandong University, Jinan, 250100, China

    Guojun LI

  3. Computational Systems and Biology Laboratory, Department of Biochemistry and Molecular Biology, the University of Georgia, Anthens, 3060, USA

    Guojun LI

Authors
  1. Hongluan ZHAO
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guojun LI
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hongluan ZHAO.

Additional information

*This research is supported by the National Natural Science Foundation of China under Grant No. 60373025 and Taishan Scholar Fund from Shandong Province.

Rights and permissions

Reprints and permissions

About this article

Cite this article

ZHAO, H., LI, G. Unbounded batch scheduling with a common due window on a single machine*. J Syst Sci Complex 21, 296–303 (2008). https://doi.org/10.1007/s11424-008-9113-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-008-9113-y

Keywords

Search

Navigation