Scheduling jobs with release dates and tails on identical machines to minimize the makespan-Reference-Cited by-同舟云学术

Scheduling jobs with release dates and tails on identical machines to minimize the makespan

Published:1987-06 Issue:3 Volume:29 Page:298-306
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Carlier Jacques

Publisher

Elsevier BV

Subject

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

Reference21 articles.

1. Sequencing with due dates and early start times to minimize tardiness;Baker;Naval Research Logistics Quarterly,1974

2. Deadline scheduling of tasks with ready times and resource constraints;Blazewicz;Information Processing Letters,1979

3. On sequencing with earliest starts and due dates with applications to computing bounds for the n/m/G/Fmax problem;Bratley;Naval Research Logistics Quarterly,1971

4. Problèmes d'ordonnancements à contraintes de ressources: algorithmes et complexité;Carlier;Thèse d'état,1984

5. Ordonnancements à contraintes disjonctives;Carlier;RAIRO,1978

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

1. Multi-stage hybrid flow shop scheduling problem with lag, unloading, and transportation times;PeerJ Computer Science;2024-08-30

2. Measuring the slack between lower bounds for scheduling on parallel machines;Annals of Operations Research;2023-12-19

3. Effective Two-Phase Heuristic and Lower Bounds for Multi-Stage Flexible Flow Shop Scheduling Problem with Unloading Times;Symmetry;2023-10-31

4. Algorithms to compute the energetic lower bounds of the cumulative scheduling problem;Annals of Operations Research;2023-10-04

5. Scheduling in manufacturing with transportation: Classification and solution techniques;European Journal of Operational Research;2023-10