Research on Disruption Management of Single Machine Scheduling
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.
KeywordsScheduling Disruption management JIT Dynamic planning algorithm
- 1.Baker KR (1974) Introduction to sequencing and scheduling. John Wiley and Sons, New YorkGoogle Scholar
- 3.Baker KR, Scudder GD (1990) Sequencing with earliness and tardiness penalties: a review. Opns Res 38:22–36Google Scholar
- 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.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