Uniform parallel machine scheduling problems with fixed machine cost

DOI10.1007/S11590-016-1096-3MaRDI QIDQ683926zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Uniform parallel machine scheduling with resource consumption constraint
• Scheduling on uniform nonsimultaneous parallel machines
• Uniform parallel-machine scheduling with time dependent processing times
• Scheduling of uniform parallel machines with s-precedence constraints
• Uniform machine scheduling with machine available constraints
• scientific article; zbMATH DE number 4023000
• Parallel machine scheduling problems considering regular measures of performance and machine cost
• Scheduling on uniform parallel machines to minimize maximum lateness
• Uniform machine scheduling of unit-time jobs subject to resource constraints
• On the complexity of scheduling problems with a fixed number of parallel identical machines

Cites work

• scientific article; zbMATH DE number 1418274 (Why is no real title available?)
• A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
• A Level Algorithm for Preemptive Scheduling
• A guessing game and randomized online algorithms
• Complexity of single machine hierarchical scheduling: A survey
• New upper and lower bounds for online scheduling with machine cost
• Online scheduling with general machine cost functions
• Online scheduling with machine cost and rejection
• Parallel Machine Scheduling: Impact of Adding Extra Machines
• Parallel machine selection and job scheduling to minimize machine cost and job tardiness
• Preemptive online algorithms for scheduling with machine cost
• Scheduling with machine cost and rejection
• Semi-online scheduling with machine cost.
• Single machine serial-batching scheduling with independent setup time and deteriorating job processing times

Cited in

(4)

• A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs
• Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time
• Parallel machine scheduling problems considering regular measures of performance and machine cost
• Optimal preemptive algorithm for parallel machine scheduling with learning effect in cloud manufacturing

This page was built for publication: Uniform parallel machine scheduling problems with fixed machine cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683926)