Mirror image property for the optimal solutions of two single processor scheduling problems with due intervals determination

• Autorzy: Janiak A.
• Języki publikacji: EN

Abstrakty

EN

In the paper, we investigate two single processor problems, which deal with the process of negotiation between a producer and a customer about delivery time of final products. This process is modelled by a due interval, which is a generalization of well known classical due date and describes a time interval, in which a job should be finished. In this paper we consider two different mathematical models of due intervals. In both considered problems we should find such a schedule of jobs and such a determination of due intervals to each job, that the generalized cost function is minimized. The cost function is the maximum of the following three weighted parts: the maximum tardiness, the maximum earliness and the maximum due interval size. For the first problem we proved several properties o(its optimal solution and next we show the mirror image property for both of considered problems, which helps us to provide an optimal solution for the second problem.

Słowa kluczowe

EN

scheduling; processor; due interval; cost criterion

• Wydawca: Polska Akademia Nauk, Wydział IV Nauk Technicznych
• Czasopismo: Bulletin of the Polish Academy of Sciences. Technical Sciences
• Rocznik: 2004
• Tom: Vol. 52, nr 2
• Strony: 115--118
• Opis fizyczny: Bibliogr. 8 poz., 1 rys.

Twórcy

autor

Janiak A.

• Institute of Engineering Cybernetics, Wroclaw University of Technology, 11/17 Janiszewskiego St., 50-372 Wrocław, Poland

Bibliografia

• [1] T. C. E. Cheng and M. C. Gupta, “Survey of scheduling research involving due date determination decision”, Eur. J. Oper. Res. 38, 156–166 (1989).
• [2] C. Chengbin, V. Gordon and J-M. Proth, “A survey of the state-of-the-art of common due date assignment and scheduling research”, Eur. J. Oper. Res. 139, 1–25 (2002).
• [3] C. Chengbin, V. Gordon and J-M. Proth, “Due date assignment and scheduling: SLK, TWK and other due date assignment models”, Prod. Plan. Control. 13(2), 117–132 (2002).
• [4] A. Janiak and M. Marek, “Single scheduling problem with optimal due interval assignment”, Lecture Notes of Silesia University of Technology, s. Automation 129, 145–155 (2000), Gliwice. (in Polish).
• [5] A. Janiak and M. Marek, “Multi-machine scheduling problem with optimal due interval assignment subject to generalized sum type criterion”, in: Operations Research Proceedings 2001, pp. 207–212, ed.: P. Chamoni, R. Leisten, A. Martin, J. Minnemann, H. Stadtler,
• Springer-Verlag, Berlin Heidelberg (2002).
• [6] F-J. Kramer and C-Y. Lee, “Due window scheduling for parallel machine”, Math. Comput. Model. 20, 69–89 (1994).
• [7] S. D. Liman, S. S. Panwalkar and S. Thongmee, “Determination of common duew indow location in a single machinesc heduling problem”, Eur. J. Oper. Res. 93, 68–74 (1996).
• [8] S. D. Liman, S. S. Panwalkar and S. Thongme e ,“Common due window size and location determination in a single machine scheduling problem”, J. Oper. Res. Soc. 49, 1007–1010 (1998).