In this paper, we consider the single machine earliness/tardiness scheduling problem with di/erent release dates and no unforced idle time. The problem is decomposed into weighted earliness and weighted tardiness subproblems. Lower bounding procedures are proposed for each of these subproblems, and the lower bound for the original problem is the sum of the lower bounds for the two subproblems. ...

A new meta-heuristic for scheduling multiple jobs on a single machine so that they are completed by a common specified date (neither earlier, nor later) is addressed in this paper. Costs are set depending on whether a job finished before (earliness), or after (tardiness) the specified due date. The objective is to minimize the total weighted earliness and tardiness penalized costs from the spec...

Abstract—In most classical scheduling models, a job is assumed to deliver to a customer at the instant of a job processing completion. In numerous practical situations, however, multiple delivery dates exist, where the time interval between any two consecutive delivery dates is constant. This type of fixed delivery strategy results in substantial cost savings for transportation and handling. Th...

This study was to estimate the GCA of the parents and SCA considered for the development of high yielding and better quality cultivars. Eleven genotypes and 28 F1 hybrids obtained by crossing 4 lines and 7 testers in line X tester mating system were sown in randomized complete block design. L X T analysis revealed significant GCA and SCA effects for all the traits except earliness. Among the pa...

nowadays, scheduling problems have a considerable application in production and service systems. in this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. in many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combinat...

This paper investigates the single-machine due-window assignment scheduling with truncated learning effects and past-sequence-dependent setup times simultaneously. The scheduler has option of job-rejection, i.e., some jobs are processed other rejected. Under three (i.e., common, slack different) methods, our goal is to minimize sum a general earliness-tardiness cost weighted earliness-tardiness...

The usefulness of remaining cycle time models for predictive and prescriptive process monitoring depends not only on the overall accuracy predictions but also their earliness: should be as accurate possible, early possible. To give this criterion more weight in model fitting, paper evaluates three L1 loss functions with temporal decay. All have property increasing residuals from stages a relati...