Skip to main content
SpringerLink
Log in
Book cover

Classification, Automation, and New Media pp 323–332Cite as

Common Due Date Scheduling — Straddling Jobs and Due Windows —

  • Conference paper

  • 371 Accesses

Abstract

This paper deals with two important NP-hard JIT-scheduling problems. First, the restrictive single machine common due date scheduling (CDDS) with individual earliness and tardiness penalties is analysed. Second, the question is extended to the more general case of the restrictive common due window scheduling (CDWS). Along with local search different meta-heuristics may be of interest — but at any rate primarily an appropriate problem representation has to be found. For the CDDS and CDWS some very beneficial properties of optimal solutions exist that submit a classification of these solutions in three or rather seven cases. In contrast to techniques, already developed a new problemrepresentation with dummy jobs, given in this paper, does not exclude some optimal solutions a priori. It has become possible to map the complete space of optimal solutions for restrictive CDDS and CDWS instances with minimal effort; furthermore, different local search operators, which could generate reasonable neighbourhoods are conceivable.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Azizoglu, M. and Webster, S. (1997): Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates. HE Transactions, 29, 1001–1006.

    Google Scholar 

  • Baker, K.R. and Scudder, G.D. (1989): On the assignment of optimal due dates. Journal of the Operational Research Society, 40, 93–95.

    MATH  Google Scholar 

  • Baker, K. R. and Scudder, G. D. (1990): Sequencing with earliness and tardiness penalties: a review. Operations Research, 38, 22–36.

    Article  MathSciNet  MATH  Google Scholar 

  • Biskup, D. and Feldmann, M. (2000): Benchmarks for scheduling on a single-machine against restrictive and unrestrictive common due dates. To appear in Computers & OR.

    Google Scholar 

  • Cheng, T.C.E. and Kahlbacher, H.G. (1991): A proof for the longest-job-first policy in one-machine scheduling. Naval Research Logistics, 38, 715–720.

    Article  MathSciNet  MATH  Google Scholar 

  • Feldmann, M. and Biskup, D. (1999): Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches. To appear in Applied Intelligence.

    Google Scholar 

  • Feldmann, M. (2000): A Development framework for Nature Analogic Heuristics. In: Gaul, W. and Decker, R. (eds.) Classification and Information Processing at the turn of the Millenium, Springer, Heidelberg, 192–200.

    Chapter  Google Scholar 

  • Hall, N.G. and Posner, M.E. (1991): Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date. Operations Research, 39, 836–846.

    Article  MathSciNet  MATH  Google Scholar 

  • Hoogeveen J. A. and Van De Velde, S. L. (1991): Scheduling around a small common due date. European Journal of Operational Research, 55, 237–242.

    Article  MATH  Google Scholar 

  • James, R.J.W. (1997): Using tabu search to solve the common due date early/tardy machine scheduling problem. Computers & OR, 24, 199–208.

    Article  MATH  Google Scholar 

  • James, R.J.W. (1999): personal communication.

    Google Scholar 

  • Kanet, J.J. (1981): Minimizing the average deviation of job completion times about a common due date. Naval Research Logistics Quarterly, 28, 643–651.

    Article  MATH  Google Scholar 

  • KrÄMer, F.-J. and Lee, C.-Y. (1993): Common Due-Window Scheduling. Production and Operations Management, 2, 262–275.

    Article  Google Scholar 

  • LEE C.-Y. and S. J. KIM (1995): Parallel genetic algorithms for the earlinesstardiness job scheduling problem with general penalty weights. Computers & Industrial Engineering, 28, 231–243.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Betriebswirtschaftslehre und Unternehmensforschung, Universität Bielefeld, D-33501, Bielefeld, Germany

    Martin Feldmann

Authors
  1. Martin Feldmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Decision Theory and Operations Research, University of Karlsruhe, Kaiserstraße 12, 76128, Karlsruhe, Germany

    Wolfgang Gaul

  2. Department of Mathematics and Informatics, University of Passau, Innstraße 33, 94030, Passau, Germany

    Gunter Ritter

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Feldmann, M. (2002). Common Due Date Scheduling — Straddling Jobs and Due Windows —. In: Gaul, W., Ritter, G. (eds) Classification, Automation, and New Media. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55991-4_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-55991-4_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43233-3

  • Online ISBN: 978-3-642-55991-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation