A data intensive heuristic approach to the two-stage streaming scheduling problem

DOI10.1016/J.JCSS.2017.01.005zbMath1372.68049OpenAlexW2587389608MaRDI QIDQ2402350

Wei Liang, Min Wu, Chun-hua Hu, Qun Jin

Publication date: 7 September 2017

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2017.01.005

zbMATH Keywords

schedulingmakespanNP-hardnessdata-intensive computing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• A taxonomy of flexible flow line scheduling procedures
• Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan
• The hybrid flow shop scheduling problem
• Optimal two- and three-stage production schedules with setup times included
• Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• Task Scheduling on Adaptive Multi-Core
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: A data intensive heuristic approach to the two-stage streaming scheduling problem