A general lower bound for the makespan problem-Reference-Cited by-同舟云学术

A general lower bound for the makespan problem

Published:1996-03 Issue:3 Volume:89 Page:516-524
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Webster S.T.

Publisher

Elsevier BV

Subject

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

Reference10 articles.

1. Introduction to Sequencing and Scheduling;Baker,1974

2. Scheduling of parallel processors: A posterior bound on LPT sequencing and a two-step algorithm;Blocher;Naval Research Logistics,1991

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

4. A generalized bound on LPT sequencing;Coffman;RAIRO-Informatique,1976

5. The asymptotic optimality of the LPT rule;Frenk;Mathematics of Operations Research,1987

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

1. Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks;International Journal of Production Economics;2018-07

2. Search tree based approaches for parallel machine scheduling;Computers & Operations Research;2008-04

3. Operations research at container terminals: a literature update;OR Spectrum;2007-10-10

4. Tight bounds for the identical parallel machine scheduling problem;International Transactions in Operational Research;2006-11

5. Bounding Strategies for Scheduling on Identical Parallel Machines;2006 International Conference on Service Systems and Service Management;2006-10