We consider a queueing facility where customers decide when to arrive. All customers have the same desired arrival time (w.l.o.g. time zero). There is one server, and the service times are independent and exponentially distributed. The total number of customers that demand service is random, and follows the Poisson distribution. Each customer wishes to minimize the sum of three costs: earliness...

This study considers the job scheduling problem of minimizing the weighted waiting time variance (WWTV) of jobs. It is an extension of WTV minimization problems in which we schedule a batch of n jobs, for servicing on a single resource, in such a way that the variance of their waiting times is minimized. WWTV minimization finds its applications for job scheduling in manufacturing systems with e...

We study a common due-date assignment problem on two parallel uniform machines. The jobs are assumed to have identical processing times, and job-dependent asymmetric earliness tardiness unit costs. scheduler may process only subset of the jobs, i.e. option job-rejection is allowed. objective function consists three cost components: total earliness-tardiness all scheduled due-date, rejection cos...

This work proposes a unified heuristic algorithm for a large class of earliness-tardiness (E-T) scheduling problems. We consider single/parallel machine E-T problems that may or may not consider some additional features such as idle time, setup times and release dates. In addition, we also consider those problems whose objective is to minimize either the total (average) weighted completion time...

We address the single-machine stochastic scheduling problem with an objective of minimizing total expected earliness and tardiness costs, assuming that processing times follow normal distributions and due dates are decisions. We develop a branch and bound algorithm to find optimal solutions to this problem and report the results of computational experiments. We also test some heuristic procedur...

In this paper, a scheduling problem for multiple automated guided vehicles (AGVs) in a manufacturing system is proposed and formulated. Considering the due date of AGVs requiring for material handling among shops in a jobshop layout, their earliness and tardiness are significant in satisfying the expected cycle time and from an economic view point. Earliness results in AGVs waiting and tardines...

Abstract This research quantifies the relationship between the cost of earliness and lateness by empirically observing commute trips from two different sources. The first empirical analysis uses individual level travel survey data from six metropolitan regions while the second analysis uses traffic data from the Twin Cities freeway network. The analysis conducted in this research provides a met...

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