A note on the single machine scheduling to minimize the number of tardy jobs with deadlines-Reference-Cited by-同舟云学术

A note on the single machine scheduling to minimize the number of tardy jobs with deadlines

Published:2010-03 Issue:3 Volume:201 Page:966-970
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

He Cheng,Lin Yixun,Yuan Jinjiang

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference7 articles.

1. P. Brucker, Scheduling Algorithms, third ed., 2003.

2. Monge properties, discrete convexity and applications;Burkard;European Journal of Operational Research,2007

3. Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness;Huo;European Journal of Operational Research,2007

4. Combinatorial Optimization: Theory and Algorithms;Korte,2008

5. E.L. Lawler, Scheduling a single machine to minimize the number of late jobs, Unpublished manuscript.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work;Naval Research Logistics (NRL);2022-02-13

2. Scheduling to tradeoff between the number and the length of accepted jobs;Theoretical Computer Science;2021-11

3. Single-machine scheduling with positional due indices and positional deadlines;Discrete Optimization;2019-11

4. A HYBRID META-HEURISTIC ALGORITHM TO MINIMIZE THE NUMBER OF TARDY JOBS IN A DYNAMIC TWO-MACHINE FLOW SHOP PROBLEM;NUMER ALGEBR CONTROL;2017

5. A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem;Numerical Algebra, Control & Optimization;2017