Approximate algorithms for the P C_ problem

DOI10.1007/BF02568517zbMATH Open0887.90085OpenAlexW2046046286MaRDI QIDQ1367883FDOQ1367883

Authors: Bernhard Rupp 

Publication date: 6 May 1998

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02568517

Recommendations

• scientific article; zbMATH DE number 2162223
• Approximation algorithms for scheduling parallel jobs
• Minimizing the makespan in nonpreemptive parallel machine scheduling problem
• Approximation algorithms for scheduling unrelated parallel machines
• Parallel machines scheduling with nonsimultaneous machine available time

zbMATH Keywords

heuristic algorithmsidentical parallel machinesindependent and nonpreemptable jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimal two- and three-stage production schedules with set-up time included
• Title not available (Why is that?)
• Bounds for Certain Multiprocessing Anomalies
• A state-of-the-art review of parallel-machine scheduling research
• Title not available (Why is that?)
• An Application of Bin-Packing to Multiprocessor Scheduling
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Fast algorithms for bin packing
• Scheduling with deadlines and loss functions
• Title not available (Why is that?)
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• The rate of convergence to optimality of the LPT rule
• The Asymptotic Optimality of the LPT Rule

Cited In (16)

• Parallel algorithms for solution of problems in scheduling theory
• List scheduling algorithms to minimize the makespan on identical parallel machines
• Title not available (Why is that?)
• A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem
• Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system
• A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem
• Title not available (Why is that?)
• Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata, Languages and Programming
• Approximating the discrete resource sharing scheduling problem
• Approximation algorithms for \(k\)-hurdle problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Approximate algorithms for the \(P\parallel C_{\max}\) problem

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