Preemptive scheduling on identical parallel machines subject to deadlines-Reference-Cited by-同舟云学术

Preemptive scheduling on identical parallel machines subject to deadlines

Published:2003-07 Issue:1 Volume:148 Page:205-210
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Azizoğlu Meral

Publisher

Elsevier BV

Subject

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

Reference11 articles.

1. Introduction to Sequencing and Scheduling;Baker,1974

2. Scheduling Algorithms;Brucker,1998

3. Scheduling independent tasks to reduce mean finishing time;Bruno;Communications of the ACM,1974

4. Theory of Scheduling;Conway,1967

5. Minimizing mean flow time with release time constraint;Du;Theoretical Computer Science,1990

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

1. Scheduling in a two-stage flowshop with parallel unrelated machines at each stage and shared resources;Computers & Industrial Engineering;2018-12

2. A branch-and-bound algorithm for identical parallel machine total tardiness scheduling problem with preemption;Journal of Industrial and Production Engineering;2016-03

3. A multi-objective optimization for preemptive identical parallel machines scheduling problem;Computational and Applied Mathematics;2015-12-07

4. Minimizing flow time for the worker assignment problem in identical parallel machine models using GA;The International Journal of Advanced Manufacturing Technology;2009-10-08

5. Scheduling on identical parallel machines to minimize total completion time with deadline and machine eligibility constraints;The International Journal of Advanced Manufacturing Technology;2008-02-12