نتایج جستجو برای: number of tardy job
تعداد نتایج: 21185948 فیلتر نتایج به سال:
This paper presents a review of single machine scheduling to minimize the weighted number of tardy jobs. The problem involves processing n jobs on a single machine, each having processing time pj and due date dj . The aim is to schedule the jobs to meet their due date. A job is tardy if the completion time of job j is Cj > dj and on-time otherwise. This paper assesses works done to minimize the...
on- the-job training on of the most effective tools for managers to cope with the changing organizational environment. it grantess suitable services to customers, particularly in public service enterprises. if such training os goal oriented, planned systematically, and tailored to the employees, job content, then not only it could increase employees and organizational performance, but also it c...
In traditional scheduling problems, most literature assumes that the processing time of a job is fixed. However, there are many situations where the processing time of a job depends on the starting time or the position of the job in a sequence. In such situations, the actual processing time of a job may be more or less than its normal processing time if it is scheduled later. This phenomenon is...
abstract this mixed method study examines whether there is any relationship among the variables of the study (job satisfaction, social capital and motivation). the researcher considered job satisfaction and social capital as independent variables; motivation is the dependent variable of the study. the researcher applied a questionnaire to assess each variable. to measure efl teachers’ job sati...
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...
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...
abstract: this paper considers the problem of scheduling n jobs on m unrelated parallel machines with sequence-dependent setup times. to better comply with industrial situations, jobs have varying due dates and ready times and there are some precedence relations between them. furthermore sequence-dependent setup times and anticipatory setups are included in the proposed model. the objective is ...
Keywords: Single-machine sequencing Weighted number of tardy jobs Due date assignment a b s t r a c t The single-machine due date assignment problem with the weighted number of tardy jobs objective, (the TWNTD problem), and its generalization with resource allocation decisions and controllable job processing times have been solved in O(n 4) time by formulating and solving a series of assignment...
Meeting due dates is the most important goal of scheduling if the due date of each job has been promised to its customer. This paper considers the job-shop scheduling problem of minimizing the total holding cost of completed and in-process products subject to no tardy jobs. A heuristic algorithm based on the shifting bottleneck procedure is proposed for solving the minimum total holding cost pr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید