%0 Journal Article
%T Single processor scheduling problems with various models of a due window assignment
%A A. Janiak
%A W. A. Janiak
%A M. Marek
%J Bulletin of the Polish Academy of Sciences: Technical Sciences
%D 2009
%I 
%R 10.2478/v10175-010-0110-7
%X In the paper we investigate four single processor scheduling problems, which deal with the process of the negotiation between a producer and a customer about delivery time of final products. This process is modeled by a due window, which is a generalization of well known classical due date and describes a time interval, in which a job should be finished. Due window assignment is a new approach, which has been investigated in the scientific literature for a few years. In this paper we consider various models of due window assignment. To solve the formulated problems we have to find such a schedule of jobs and such an assignment of due windows to each job, which minimizes a given criterion dependent on the maximum or total earliness and tardiness of jobs and due window parameters. One of the main results is the mirror image of the solutions of the considered problems and other problems presented in the scientific literature. The wide survey of the literature is also given.
%K scheduling
%K single machine
%K earliness/tardiness
%K due window assignment
%U http://versita.metapress.com/content/43015258773u5685/?p=1df638bcdaeb40f49cc4cde94c6c513b&pi=9