Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date-Reference-Cited by-同舟云学术

Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date

Published:2020-07 Issue:1 Volume:284 Page:67-74
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Chen Xin,Liang Yage,Sterna Małgorzata,Wang Wen,Błażewicz Jacek

Funder

Natural Science Foundation of Liaoning

Poznan University of Technology

Publisher

Elsevier BV

Subject

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

Reference46 articles.

1. Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays;Abasian;Applied Mathematical Modelling,2014

2. Design of high-performing hybrid meta-heuristics for unrelated parallel machine scheduling with machine eligibility and precedence constraints;Afzalirad;Engineering Optimization,2016

3. Approximation schemes for scheduling on parallel machines;Alon;Journal of Scheduling,1998

4. A single machine scheduling problem to minimize total early work;Ben-Yehoshua;Computers & Operations Research,2016

5. Scheduling preemptible tasks on parallel processors with information loss;Blazewicz;Technique et Science Informatiques,1984

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

1. Online early work scheduling on parallel machines;European Journal of Operational Research;2024-06

2. No-Idle Flow Shop Scheduling with Deteriorating Jobs and Common Due Date Under Dominating Machines;Asia-Pacific Journal of Operational Research;2024-02-29

3. Common due-date assignment problems with fixed-plus-linear earliness and tardiness costs;Computers & Industrial Engineering;2024-02

4. The Two Single-Machine Scheduling Problems with Slack Due Date to Minimize Total Early Work and Late Work;Journal of the Operations Research Society of China;2024-01-29

5. Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work;International Journal of Applied Mathematics and Computer Science;2024