Minimizing total flow time subject to preemption penalties in online scheduling-Reference-Cited by-同舟云学术

Minimizing total flow time subject to preemption penalties in online scheduling

Published:2009-07-15 Issue:1-4 Volume:47 Page:227-236
ISSN:0268-3768
Container-title:The International Journal of Advanced Manufacturing Technology
language:en
Short-container-title:Int J Adv Manuf Technol

Author:

Heydari Mehdi,Sadjadi Seyed Jafar,Mohammadi Emran

Publisher

Springer Science and Business Media LLC

Subject

Industrial and Manufacturing Engineering,Computer Science Applications,Mechanical Engineering,Software,Control and Systems Engineering

Link

http://link.springer.com/content/pdf/10.1007/s00170-009-2190-9.pdf

Reference11 articles.

1. Potts CN, Wassenhove LNV (1992) Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J Oper Res Soc 43:395–406

2. Monma CL, Potts CN (1993) Analysis of heuristics for preemptive parallel machine scheduling with batch setup times. Oper Res 41:981–993

3. Chen B (1993) A better heuristic for preemptive parallel machine scheduling with batch setup times. SIAM J Comput 22:1303–1318

4. Zdrzalka S (1994) Preemptive scheduling with release dates, delivery times and sequence independent setup times. Eur J Oper Res 76:60–71

5. Schuurman P, Woeginger GJ (1999) Preemptive scheduling with job-dependent setup times. Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pp 759–767

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

1. Dynamic Windows Scheduling with Reallocation;ACM Journal of Experimental Algorithmics;2021-12-31

2. Graph multi-coloring for a job scheduling application;Discrete Applied Mathematics;2018-01

3. Scheduling Data Gathering with Maximum Lateness Objective;Parallel Processing and Applied Mathematics;2018

4. A preemptive priority queue with preemptions penalty;The International Journal of Advanced Manufacturing Technology;2014-10-18

5. Dynamic Windows Scheduling with Reallocation;Experimental Algorithms;2014