Abstract
In this paper we consider a total penalty for the n job, one machine scheduling problem in which all jobs have a common due date. This penalty function is based on the due date value and on the earliness or the lateness of each job in the selected sequence. The main objective is to determine the optimal value of this due date and an optimal sequence to minimize a total penalty function. We prove that the optimal due date result can be generalized to the parallel machine problem. The problem of simultaneously available jobs on several parallel and identical machines. The problem is to find the optimal due date, assuming this to be the same for all jobs and we present a simple heuristic to find an approximate solution. On the basis of a limited experiment, we observe that the heuristic is very effective solution.
Highlights
We consider the basic one machine sequencing problem under the common assumptions listed in Baker [1]
We consider a total penalty for the n job, one machine scheduling problem in which all jobs have a common due date
The main objective is to determine the optimal value of this due date and an optimal sequence to minimize a total penalty function
Summary
We consider the basic one machine sequencing problem under the common assumptions listed in Baker [1]. The objective is to find an optimal value of the due date and an optimal sequence which minimizes the total penalty based on the due date value and the earliness or tardiness of each job.The few studies analyzing due date selection procedures that of Baker and Bertrand [2] are the most recent and directly related to the present one. They considered (among other things) a static one machine problem. Their objective, was only to find the lowest value of due date such that no job would be tardy
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
