Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria-Reference-Cited by-同舟云学术

Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria

Published:2005-08 Issue:3 Volume:164 Page:851-855
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Yuan Jinjiang,Lin Yixun

Publisher

Elsevier BV

Subject

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

Reference10 articles.

1. Scheduling Algorithms;Brucker,2001

2. Minimizing total tardiness on one machine is NP-hard;Du;Mathematics of Operations Research,1990

3. Sequencing and Scheduling: An Introduction to the Mathematics of the Job-shop;French,1982

4. Reducibility among combinatorial problems;Karp,1972

5. A functional equation and its application to resource allocation and sequencing problems;Lawler;Management Science,1969

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

1. The Single-Machine Preemptive or Resumable Scheduling with Maintenance Intervals;Journal of the Operations Research Society of China;2023-06-17

2. 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

3. Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work;Journal of Combinatorial Optimization;2021-01-20

4. Single-machine scheduling with maintenance activities and rejection;Discrete Optimization;2020-11

5. Preemptive scheduling with transportation delays between machines;Journal of Modelling in Management;2020-01-13