A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
This paper is concerned with the 1||∑ p_jU_j problem, the problem of minimizing the total processing time of tardy jobs on a single machine. ... The fastest known pseudo-polynomial time algorithm for the problem is the famous Lawler and Moore algorithm which runs in O(P · n) time, where P is the total processing time of all n jobs in the input. ... Introduction In this paper we consider the problem of minimizing the total processing times of tardy jobs on a single machine. ...arXiv:2003.07104v1 fatcat:qemnhy4n7jcklewhmxagu5wjqa
Without any assurance for a single job scheduling problem, the efficient exact minimization of total tardiness by the descending job order input must be treated as on average only. ... The goal is to ascertain whether the job order in tight-tardy progressive single machine scheduling with idling-free preemptions influences the speed of computing the exact solution. ... Job order input for efficient exact minimization of total tardiness in tight-tardy progressive single machine scheduling with idling-free preemptions executed on average faster by the descending job order ...doi:10.33243/2518-7139-2020-1-1-19-36 fatcat:4vls2kztr5hwbhlm65oy3s4jzi
This paper considers the problem of minimizing the number of tardy jobs with release time on a single machine. ... Experimental results show that one of the proposed heuristics (EOO) outperforms other heuristics, both in terms of quality of solution (effectiveness) and speed of execution (efficiency). ... THE PROBLEM Given the general one-machine scheduling problem, where a set J of n jobs has to be sequenced on a machine in order to minimize the number of tardy jobs, only one job can be processed at a ...doi:10.7166/19-2-100 fatcat:brg56q27ejejzawk4qiegianci
KPI Science News
For instance, schedules of 5 jobs consisting of two processing periods each are found on average by 14.67 % faster for the descending job order. ... The goal is to ascertain whether the job order in tight-tardy progressive single machine scheduling with idling-free preemptions of equal-length jobs influences the speed of computing the exact solution ... In this example, the time saved on a single job scheduling problem owing to the efficient total tardiness exact minimization by the descending job order is about 32.99 seconds. ...doi:10.20535/kpi-sn.2020.1.180877 fatcat:qavekzofmbbovgyeinttkteamy
International Journal of Performability Engineering
In this paper, the batch scheduling of hot-rolled steel tubes with maintenance and tardiness are considered and abstracted into a single machine scheduling problem with maintenance and tardiness. ... Combined with the constraint of sequence-dependent setup times, a multiobjective integer programming model is established to minimize the total idle time, total setup time, and total tardiness, and a two-stage ... In summary, for the actual production characteristics of seamless steel tubes, they are abstracted into a multi-objective single machine scheduling problem, and a mathematical model for minimizing the ...doi:10.23940/ijpe.19.07.p11.18491859 fatcat:gskrnbtsqvaqbork7ayac5nlua
The Journal of the Operational Research Society
Lee er a/ (2004) considered a bi-criteria single-machine scheduling problem, and Lee and Wu (2004) considered the problem of minimizing the total completion time in a two-machine flowshop. ... Essentially. minimizing the flow time keeps the work-in-process inventory at a low level. while minimizing the tardiness reduces the penalties incurred for late jobs. ...
Lawler, A fully polynomial approximation scheme for the total tardiness problem, Operations Research Letters 1 (1982) 207-208] proposed a fully polynomial approximation scheme for the single-machine total ... tardiness problem which runs in O n 7 e time (where n is the number of jobs and e is the desired level of approximation). ... Acknowledgements We would like to thank the referees for their constructive criticism which helped us improve an earlier version of this note and for making us aware of Kovalyov's  paper. ...doi:10.1016/j.ejor.2007.12.031 fatcat:xvkjl77b2vhy5aqwialhxakuyy
From other point, on time delivery of products and services is a major necessity of companies' todays; early and tardy delivery times will result additional cost such as holding or penalty costs. ... In this paper, just-in-time (JIT) flow shop scheduling problem with preemption and machine idle time assumptions is considered in which objective function is minimizing the sum of weighted earliness and ... Khorshidian et al (2011) minimized the total weighted earliness and tardiness of a single machine problem with the allowance of preemption and idle time for machine. ...doi:10.1016/j.ejor.2011.07.053 fatcat:pxgv7pokpbcujegkqoijrxekp4
The Journal of the Operational Research Society
Summary The problem of scheduling on a single-machine with the objective of minimizing the sum of weighted tardiness of jobs has been considered in this paper. ... In the case of the general m-machine flowshop problem, the jobs are arranged in the descending order of their total process times on all machines. ...
RUSSELL Department of Management Science, The University of South Carolina, USA The problem of minimizing total tardiness assumes that the N jobs to be processed on a single machine are simultaneously ... FERNANDEZ (1989) A heuristic solution procedure to minimize 7 on a single machine. J. Opl Res. Soc. 40, 293-297. . V. ...doi:10.1057/jors.1992.6 fatcat:s5uyk2gvdzdf3fnvhtaj3c6ovi
This paper addresses the hybrid flow shop scheduling problem by considering job rejection to minimize the sum of the total tardiness cost of the scheduled jobs and total cost of the rejected jobs as a ... As well as, in this paper, the problem is viewed from a bi-objective problem perspective, so that the tardiness costs of the scheduled jobs and rejection costs of rejected jobs as two objectives are minimized ... Every job can be processed by no more than one machine at a same time, while every machine can synchronously process a maximum of one job. ...doi:10.1007/s12351-021-00629-2 fatcat:33sxe5n7znhtxls3fnttt7dg5a
This paper shows that the single-machine scheduling problems to minimize the makespan, sum of the kth power of completion times, total lateness and sum of earliness penalties (with a common due date) are ... By the effects of learning and deterioration, we mean that job processing times are defined by functions of their start times and positions in the sequence. ... This research was supported by the National Natural Science Foundation of China (90818025). ...doi:10.1016/j.camwa.2010.10.036 fatcat:ix7lsv7t2nhvng2nhozthityvu
Finally, comparative experiments indicate the proposed ATC-ACO algorithm has better performance on minimizing energy consumption as well as total tardiness and the modified ATC heuristic rule is more effectively ... This research considers an unrelated parallel machine scheduling problem with energy consumption and total tardiness. ... Acknowledgments This work was supported by National Natural Science Foundation of China (no. 51475096) and Guangdong Province Key Scientific and Technological Project, no. 2012A080104022. ...doi:10.1155/2015/907034 fatcat:wdvrer7onje2lggbtvj7yddsc4
It is assumed that a job's processing time depends on its position in a sequence. ... This paper considers single machine scheduling and due date assignment with setup time. ... Acknowledgments The authors are grateful to the editor and three anonymous referees for their helpful comments on the earlier version of the paper. ...doi:10.1155/2014/620150 pmid:25258727 pmcid:PMC4167446 fatcat:srlngj7irjfebd6kr6q2bw6lyu
This paper consider the bicriteria scheduling problem of simultaneously minimizing the total completion time (Ctot) and number of tardy jobs (NT) with release dates on a single machine. ... The proposed heuristic makes use of the idea of truncation and composition of schedules. The three solution methods were tested on 1100 randomly generated problems ranging from 3 to 500 jobs. ... criterion scheduling problem of minimizing the number of tardy jobs on a single machine with release time. ...doi:10.5251/ajsir.2010.1.3.427.434 fatcat:q6coj5m2ergv7djfol7ro6fbbi
« Previous Showing results 1 — 15 out of 2,307 results