Common Due Window Size and Location Determination in a Single Machine Scheduling Problem

Liman, S. D.; Panwalkar, S. S.; Thongmee, S.

doi:10.2307/3010176

Cited by 22 publications

(42 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have reviewed the results concerning the classical models Brought to you by | MIT Libraries Authenticated Download Date | 5/11/18 7:27 AM P O(n log n) (Kramer and Lee, 1993;Weng and Ventura, 1996) (Liman et al, 1998) …”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Scheduling problems with a common due window assignment: A survey

Janiak¹,

Kwiatkowski²,

Lichtenstein³

2013

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

In this article a survey of studies on scheduling problems with a common due window assignment and earliness/tardiness penalty functions is presented. A due window is a generalization of the classical due date and describes a time interval in which a job should be finished. If a job is completed before or after the due window, it incurs an earliness or a tardiness penalty, respectively. In this survey we separately analyse the classical models with job-independent and job-dependent earliness/tardiness penalty functions and some other more complicated models. We describe the computational complexity of the problems and the main features of the approaches developed to solve them. Particular attention is paid to practical applications of the analysed models. As turns out, some complicated models combining classical scheduling problems with, e.g., learning and aging effects have no reasonable practical justification in the literature.

show abstract

Section: Resultsmentioning

confidence: 99%

“…were studied by Liman et al (1998) as well as Janiak and Marek (2009;, respectively. Optimal O(n log n) time algorithms were constructed for these problems.…”

Section: Classical Models With Job-independent Earliness/tardiness Pementioning

confidence: 99%

Scheduling problems with a common due window assignment: A survey

Janiak¹,

Kwiatkowski²,

Lichtenstein³

2013

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

show abstract

“…The recent list of publications concerning scheduling problems with fixed or assignable due windows includes the papers of the following authors: Cheng [9], Lee [10], Kramer and Lee [11], Weng and Ventura [12][13][14], Liman and Ramaswamy [15], Mosheiov and Lann [16,17], Koulamas [18], Azizoglu and Webster [19], Wu and Wang [20], Linn, Yen and Zhang [21], Yeung, Oguz and Cheng [22], Yoo and Martin-Vega [23], Chen and Lee [24], Biskup and Feldmann [25], and Wodecki [26]. The due window assignment in scheduling problems with a general sum-type criterion (the most interesting for us) have been considered in the following papers by: Janiak and Marek [27,28], Kramer and Lee [29], and Liman, Panwalker and Thongmee [30,31]. In the papers [30] and [29] the authors focused on the optimal, common for all the jobs, due window assignment in some single and parallel processors scheduling problems, respectively.…”

Section: Introductionmentioning

confidence: 99%

“…In their model it is assumed that the size of the due window is given in advance. The model of due window considered in [29,30] have been extended in [27,28,31]. This extension concerns the size of due window, which is as well as the location of due window a decision variable.…”

Section: Introductionmentioning

confidence: 99%

Single processor scheduling problems with various models of a due window assignment

Janiak¹,

Janiak²,

Marek³

2009

Bulletin of the Polish Academy of Sciences: Technical Sciences

View full text Add to dashboard Cite

Abstract. 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.

show abstract

“…This period is called the duewindow of a job (cf. [1,2]). The due-window assignment methods include common due-window, slack due-window (also called common flow allowance) and others.…”

Section: Introductionmentioning

confidence: 99%

Single Machine Slack Due-Window Scheduling With Linear Resource Allocation, Aging Effect, and a Deteriorating Rate-Modifying Activity

Cheng¹,

Li²

2017

Int. J. of Appl. Math.

View full text Add to dashboard Cite

In this paper, we consider the slack due-window method and investigate single machine scheduling with a deteriorating rate-modifying activity, linear resource allocation and aging effect. The objective is to minimize the total cost caused by the due-window location, the due-window size, the earliness and tardiness with respect to a slack due-window, and resource consumption. We provide a polynomial-time algorithm to solve the corresponding problem.

show abstract

Common Due Window Size and Location Determination in a Single Machine Scheduling Problem

Cited by 22 publications

References 0 publications

Scheduling problems with a common due window assignment: A survey

Scheduling problems with a common due window assignment: A survey

Single processor scheduling problems with various models of a due window assignment

Single Machine Slack Due-Window Scheduling With Linear Resource Allocation, Aging Effect, and a Deteriorating Rate-Modifying Activity

Contact Info

Product

Resources

About