Research on Disruption Management of Single Machine Scheduling

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 288)

Abstract

Based on common due date, this paper discusses the disruption management problem in the middle of JIT. If a hardware has been finished ahead of schedule, measures have to be adopted to arrange the hardware over again in order to reach the optimization. In addition, this paper discusses the paradox that we do not punish but encourage the hardware ahead of schedule. Corresponding to such disruption management problem, this paper gives two types of algorithm and an example.

Keywords

Scheduling Disruption management JIT Dynamic planning algorithm 

References

  1. 1.
    Baker KR (1974) Introduction to sequencing and scheduling. John Wiley and Sons, New YorkGoogle Scholar
  2. 2.
    Cheng TCE, Gupta MC (1989) Survey of scheduling research involving due date determination decisions. Euro J Oper Res 38:156–166MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Baker KR, Scudder GD (1990) Sequencing with earliness and tardiness penalties: a review. Opns Res 38:22–36Google Scholar
  4. 4.
    Yan S, Tu Y (1997) Multifleet routing and multistop flight scheduling for schedule perturbation. Eur J Oper Res 103:155–169CrossRefMATHGoogle Scholar
  5. 5.
    Lee CY, Danusaputro S, Lin CS (1991) Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date. Computers Opns Res 18:379–389CrossRefMATHGoogle Scholar
  6. 6.
    Sware W (1996) The weighted commom due date single machine scheduling problem revisited. Computers Opns Res 23:255–262CrossRefGoogle Scholar
  7. 7.
    Bector CR, Gupta YP, Gupta MC (1988) Determination of an optimal common due date and optimal sequence in a single machine job shop. Int J Prod Res 26:613–628CrossRefMATHGoogle Scholar
  8. 8.
    Vickson RG (1980) Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine. Opns Res 28:1155–1167Google Scholar
  9. 9.
    Chen B, Potts CN, Woeginger GJ (1998) A review of machine scheduling: complexity, algorithm and approximability. In: Du, D–Z. et al. (eds) Handbook of combinatorial optimization, Kluwer Academic Publishers, Massachusetts, pp. 21–169Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.National School of DevelopmentPeking UniversityBeijingChina
  2. 2.School of Statistics and MathematicsZhongnan University of Economics and LawWuhanChina
  3. 3.Postdoctor Innovative Practice BaseShenzhen Statistical SocietyShenzhenChina

Personalised recommendations