Minimizing the number of tardy job units under release time constraints
نویسندگان
چکیده
We study two single-machine scheduling problems: Minimizing the weighted and unweighted number of tardy units, when release times are present. Fast strongly polynomial algorithms are given for both problems: For problems with n jobs, we give algorithms which require O(n log n) and O(n2) steps, for the unweighted and weighted problems respectively. Our results also imply an extension of the family of very efficiently solvable transportation problems, as well as these which are greedily solvable using the “Monge sequence” idea.
منابع مشابه
Minimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...
متن کاملMinimizing the Number of Tardy Jobs in a Permutation Flowshop Scheduling Problem with Setup Times and Time Lags Constraints
This paper studies the permutation flowshop scheduling problem with sequence dependent setup times and time lags constraints minimizing the number of tardy jobs. Dependent setup times are defined as the work to prepare the machines between two successive jobs. Time lags are defined as intervals of time that must exist between every couple of successive operations of the same job. Two mathematic...
متن کاملHeterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
In this paper, we present a novel O(N) algorithm to minimize the weighted number of tardy jobs with unit processing times, integer ready times and deadlines, and M homogeneous parallel machines, where N is the number of jobs to be scheduled. wi is the weight re ecting job i's importance, and Ui is 1 if job i is tardy and 0 otherwise, so P wiUi is the measure of performance. (In standard notatio...
متن کاملMinimizing Weighted Number of Tardy Jobs and Weighted Completion Time 1
In this paper, we present a novel O(N) algorithm to minimize the weighted number of tardy jobs with unit processing times, integer ready times and deadlines, and M homogeneous parallel machines, where N is the number of jobs to be scheduled. wi is the weight re ecting job i's importance, and Ui is 1 if job i is tardy and 0 otherwise, so P wiUi is the measure of performance. (In standard notatio...
متن کاملFlexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 28 شماره
صفحات -
تاریخ انتشار 1990