Preemptive multiprocessor order scheduling to minimize total weighted flowtime-Reference-Cited by-同舟云学术

Preemptive multiprocessor order scheduling to minimize total weighted flowtime

Published:2008-10 Issue:1 Volume:190 Page:40-51
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Leung Joseph Y.-T.,Lee C.Y.,Ng C.W.,Young G.H.

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. Scheduling the production of components at a common facility;Baker;IIE Transactions,1988

2. The customer order lead-time problem on parallel machines;Blocher;Naval Research Logistics,1996

3. Optimal scheduling of products with two subassemblies on a single machine;Coffman;Operations Research,1989

4. Computer and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

5. One-processor scheduling with symmetric earliness and tardiness;Garey;Mathematics of Operations Research,1988

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

1. Sequencing single machine multiple-class customer order jobs using heuristics and improved simulated annealing algorithms;RAIRO - Operations Research;2023-05

2. Solving Customer Order Scheduling Problems with an Iterated Greedy Algorithm;Lecture Notes in Operations Research;2023

3. A Genetic Hyper-Heuristic for an Order Scheduling Problem with Two Scenario-Dependent Parameters in a Parallel-Machine Environment;Mathematics;2022-11-06

4. Iterated greedy algorithms for customer order scheduling with dedicated machines;IFAC-PapersOnLine;2022

5. A robust customer order scheduling problem along with scenario-dependent component processing times and due dates;Journal of Manufacturing Systems;2021-01