Scheduling on uniform nonsimultaneous parallel machines

DOI10.1007/978-3-319-55702-1_62MaRDI QIDQ4596488zbMATH OpenOpenAlexFDO

Authors Liliana Grigoriu, Donald K. Friesen

Publication date 1 December 2017

Published in Operations Research Proceedings 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-55702-1_62

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Approximation for scheduling on uniform nonsimultaneous parallel machines
• Uniform processor scheduling problem with nonsimultaneous available time
• Tighter bound for MULTIFIT scheduling on uniform processors
• Scheduling identical jobs on uniform parallel machines
• On a special case of uniform processor scheduling

Cited in

(14)

• A linear compound algorithm for uniform machine scheduling
• Scheduling on uniform parallel machines to minimize maximum lateness
• Approximation for scheduling on uniform nonsimultaneous parallel machines
• Scheduling on uniform processors with at most one downtime on each machine
• Scheduling job classes on uniform machines
• Scheduling identical jobs on uniform parallel machines
• A heuristic for maximizing the number of on-time jobs on two uniform parallel machines
• A unified approach to scheduling on unrelated parallel machines
• Uniform processor scheduling problem with nonsimultaneous available time
• scientific article; zbMATH DE number 5631796 (Why is no real title available?)
• An Application of the Bin-packing Technique to Job Scheduling on Uniform Processors
• scientific article; zbMATH DE number 516785 (Why is no real title available?)
• A simulated annealing approach to minimize the maximum lateness on uniform parallel machines
• Uniform parallel machine scheduling problems with fixed machine cost

This page was built for publication: Scheduling on uniform nonsimultaneous parallel machines

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