Advertisement

Multi-machine Scheduling Problem with Optimal Due Interval Assignment Subject to Generalized sum Type Criterion

  • Adam Janiak
  • Marcin Marek
Conference paper
Part of the Operations Research Proceedings 2001 book series (ORP, volume 2001)

Abstract

In this paper, we consider a multi-machine scheduling problem, in which to each job a due interval should be assigned. In the scientific literature of scheduling theory, only an assignment of due date was considered. However in our case, to each job a due interval should be assigned. Due interval is a generalization of classical due date and describes a time interval, in which a job should be finished. For the considered problem, we should find a schedule of jobs and a common due interval such that the sum of: the total tardiness, the total earliness and due interval parameters is minimized. We proved an ordinary NP-completeness of the problem using the well known NP-complete partition problem. A heuristic algorithm solving the problem with its experimental analysis is also presented.

Keywords

Schedule Problem Heuristic Algorithm Partition Problem Total Tardiness Single Machine Schedule Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baker K.R., Scudder G.D. (1990) Sequencing with earliness and tardiness penalties: a review. Operations Research 30, 22–3GCrossRefGoogle Scholar
  2. 2.
    Cheng T.C.E., Gupta M.C. (1989) Survey of scheduling research involving due date determination decision. European Journal of Operational Research 38, 156–166CrossRefGoogle Scholar
  3. 3.
    Garey M. R., Johnson D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San FranciscoGoogle Scholar
  4. 4.
    Graham R.L. (1969) Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 263–369Google Scholar
  5. 5.
    Graham R. L., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G. (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 3, 287–326CrossRefGoogle Scholar
  6. 6.
    Janiak A., Marek M. (2000) Single machine scheduling problem with optimal due intervals assignment. Lecture Notes of Silesian University, Automation 129, 145–155 (in Polish)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Adam Janiak
    • 1
  • Marcin Marek
    • 1
  1. 1.Institute of Engineering CyberneticsWroclaw University of TechnologyWroclawPoland

Personalised recommendations