Heuristics for periodical batch job scheduling in a MapReduce computing framework

DOI10.1016/J.INS.2015.07.040zbMath1390.68137OpenAlexW1167386377WikidataQ58201998 ScholiaQ58201998MaRDI QIDQ1750408

Rubén Ruiz, Tianze Jiang, Xiao-Ping Li

Publication date: 22 May 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/78868

zbMATH Keywords

heuristicsmakespanMapReduceperiodical jobschedule-dependent setup times

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Uses Software

• SPOT
• Hadoop
• Unnamed Item

Cites Work

• Unnamed Item
• A two-stage hybrid flowshop with uniform machines and setup times
• A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
• Minimizing makespan in hybrid flowshops
• Heuristic algorithms for the two-stage hybrid flowshop problem
• Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
• Scheduling flexible flow lines with sequence-dependent setup times
• The hybrid flow shop scheduling problem
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times
• Optimal two- and three-stage production schedules with setup times included
• Tuning an Algorithm Using Design of Experiments
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Scheduling

This page was built for publication: Heuristics for periodical batch job scheduling in a MapReduce computing framework