Uniform parallel machine scheduling problems with fixed machine cost

DOI10.1007/s11590-016-1096-3zbMath1390.90318OpenAlexW2557235086MaRDI QIDQ683926

Kai Li, Hui-Juan Zhang, Panos M. Pardalos, Ba-Yi Cheng

Publication date: 9 February 2018

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-016-1096-3

zbMATH Keywords

heuristicnon-preemptiveuniform parallel machine schedulingpreemptive

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time

Cites Work

• Unnamed Item
• Unnamed Item
• New upper and lower bounds for online scheduling with machine cost
• Online scheduling with general machine cost functions
• Semi-online scheduling with machine cost.
• Preemptive online algorithms for scheduling with machine cost
• Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
• Scheduling with machine cost and rejection
• Parallel machine selection and job scheduling to minimize machine cost and job tardiness
• Online scheduling with machine cost and rejection
• A guessing game and randomized online algorithms
• A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
• A Level Algorithm for Preemptive Scheduling
• Parallel Machine Scheduling: Impact of Adding Extra Machines