New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria-Reference-Cited by-同舟云学术

New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria

Published:2013-12 Issue:2 Volume:231 Page:282-287
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Prot D.,Bellenguez-Morineau O.,Lahlou C.

Publisher

Elsevier BV

Subject

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

Reference21 articles.

1. The complexity of mean flow time scheduling problems with release times;Baptiste;Journal of Scheduling,2007

2. Ten notes on equal-execution-time scheduling;Baptiste;4OR,2004

3. Deterministyczne problemy szeregowaia zadan na równoleglych procesorach, Czesc I: zbiory zadan niezaleznych (Deterministic problem of scheduling tasks on parallel processors. Part I: Set of independent tasks);Blazewicz;Podstawy Sterowania,1976

4. Mathematical programming formulations for machine scheduling: a survey;Blazewicz;European Journal of Operational Research,1991

5. Brucker, P., Knust, S., 2013. Complexity results for scheduling problems. .

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

1. A genetic algorithm for the personnel task rescheduling problem with time preemption;Expert Systems with Applications;2024-03

2. Enhancing Efficiency and Delivery Performance Through Optimization of Machine Scheduling in Pre-emptive Parallel Manufacturing Systems;2023 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM);2023-12-18

3. Scheduling an Energy-Aware Parallel Machine System with Deteriorating and Learning Effects Considering Multiple Optimization Objectives and Stochastic Processing Time;Computer Modeling in Engineering & Sciences;2023

4. Credibility based chance constrained programming for parallel machine scheduling under linear deterioration and learning effects with considering setup times dependent on past sequences;Journal of Project Management;2023

5. Scheduling the capacitated identical parallel machines problem: a new formulation with sequence-dependent setup costs and different due dates;European J. of Industrial Engineering;2021