Scheduling problems involving both earliness and tardiness costs have received significant attention in recent years. This type of problem became important with the advent of the justin-time (JIT) concept, where early or tardy deliveries are highly discouraged. In this work we examine the flowshop scheduling problem with no storage constraints and with blocking inprocess. In this latter environ...

Distributed arrival time control (DATC) is a highly distributed feedback control algorithm for the scheduling problems in heterarchical operation systems [V.V. Prabhu, Performance of real-time distributed arrival time control in heterarchical manufacturing systems, IIE Transactions 32 (2000) 323–331]. Although DATC has presented outstanding performance for the real-time scheduling problems in d...

OBJECTIVE To determine whether sales of electrolyte products contain a signal of outbreaks of respiratory and diarrheal disease in children and, if so, how much earlier a signal relative to hospital diagnoses. DESIGN Retrospective analysis was conducted of sales of electrolyte products and hospital diagnoses for six urban regions in three states for the period 1998 through 2001. MEASUREMENT...

In this paper, we study a resource-constrained project scheduling problem in which a set of project activities have due dates. If the finish time of each one of these activities is not equal to its due date, an earliness or a tardiness cost exists for each tardy or early period. The objective is to minimize the sum of discounted weighted earliness-tardiness penalty costs of these activities. Sc...

The aim of this study was to analyze yields, biological efficiency, earliness (expressed as days to first harvest), and precociousness and establish models for the mushroom growing according to these parameters. The experiment followed a double factorial design with four sources of calcium (calcitic limestone, calcitic limestone + gypsum, dolomitic limestone and dolomitic limestone + gypsum) an...

This paper investigates thenotion of preemption in scheduling,with earliness and tardiness penalties. Starting from the observation that the classical cost model where penalties only depend on completion times does not capture the just-in-time philosophy, we introduce a new model where the earliness costs depend on the start times of the jobs. To solve this problem, we propose an efficient repr...

⎯In this paper, we consider the single machine earliness/tardiness scheduling problem with different release dates and no unforced idle time. The most effective lower bound uses multiplier adjustment procedures that require an initial sequence. We investigate the sensitivity of the lower bounding procedure to the initial sequences, and experiment with different scheduling rules and dominance co...

This paper presents the optimal sequence of a set of jobs for a single machine with idle insert, in which the objective function is to minimize the sum of maximum earliness and tardiness (n/1/I/ETmax). Since this problem tries to minimize and diminish the values of earliness and tardiness, the results can be useful for different production systems such as just in time (JIT). Special case of det...

In this paper, we propose n-jobs to be processed on Single Machine Scheduling Problem (SMSP) involving fuzzy processing time and fuzzy due dates. The different due dates for each job be considered which meet the demand of customer with more satisfaction level. The main objective of this paper is the total penalty cost to be minimum in the schedule of the jobs on the single machine. This cost is...

We consider a multi-period order selection problem in ̄exible manufacturing systems, which is the problem of selecting orders to be produced in each period during the upcoming planning horizon with the objective of minimising earliness and tardiness costs and subcontracting costs. The earliness and tardiness costs are incurred if an order is not ®nished on time, while subcontracting cost is incu...