This paper investigates common (slack) due-date assignment single-machine scheduling with controllable processing times within a group technology environment. Under linear and convex resource allocation functions, the cost function minimizes (including weighted sum of earliness, tardiness, assignment, where weights are position-dependent) resource-allocation costs. Given some optimal properties...

In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machines. Each job’s processing time is a nondecreasing function of its start time. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of the due-date, earliness and tardiness penalties. We show that this problem is NP-hard, and we present a heuris...

Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...

This study intends to help manufacturers that use flexible job shops improve performance of due date assignment, that is, setting delivery times to jobs that arrive dynamically. High performing due date assignment enables achieving on-time delivery and quick response of delivery time to customer orders. Traditional methods for due date assignment are predefined equations that estimate the durat...

We consider a model in which there are m products and for each i=1,...,m, there are ni observations of the service times associated with the th i product. Assuming the service times associated with the th i product follow an exponential distribution with parameter i θ , and i θ 's are independent random variables with a common gamma distribution, with unknown parameters α and β , we provide two...

In the scheduling problem addressed in this note we have to determine: (i) the job sequence, (ii) the (common) due-date, and (iii) the location of a rate modifying (maintenance) activity. Jobs scheduled before (after) the due-date are penalized according to their earliness (tardiness) value. The processing time of a job scheduled after the maintenance activity decreases by a job-dependent facto...

In this paper, a new approach for due date assignment in a multi-stage job shop is proposed and evaluated. The proposed approach is based on a genetic programming technique which is known as gene expression programming (GEP). GEP is a relatively new member of the genetic programming family. The primary objective of this research is to compare the performance of the proposed due date assignment ...