Scheduling tasks with exponential duration on unrelated parallel machines

DOI10.1016/J.DAM.2012.06.010MaRDI QIDQ714038zbMATH OpenOpenAlexFDO

Authors Mostafa Nouri, Mohammad Ghodsi

Publication date 19 October 2012

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2012.06.010

zbMATH Keywords

directed acyclic graphmultiple choice hyperbolic 0-1 programmingNP-hardstochastic parallel scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Stochastic scheduling theory in operations research (90B36)

Recommendations

• Scheduling jobs with exponential processing times on parallel machines
• Optimal Stochastic Allocation of Machines under Waiting-Time Constraints
• Stochastic scheduling on two non-identical parallel processors
• Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
• Implementation and experiments with an algorithm for parallel scheduling of complex dags under uncertainty (extended abstract)

Cites work

• (0, 1) hyperbolic programming problems
• A decomposition theorem for partially ordered sets
• Complexity of Scheduling under Precedence Constraints
• Computational geometry. Algorithms and applications.
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 6157240 (Why is no real title available?)
• scientific article; zbMATH DE number 226824 (Why is no real title available?)
• scientific article; zbMATH DE number 2190133 (Why is no real title available?)
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• Hyperbolic 0-1 programming and query optimization in information retrieval
• Introduction to algorithms
• NP-complete scheduling problems
• On complexity of unconstrained hyperbolic 0--1 programming problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Project scheduling under uncertainty: survey and research potentials
• Scheduling
• Scheduling algorithms
• Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
• Scheduling Jobs with Exponential Processing and Arrival Times on Identical Processors so as to Minimize the Expected Makespan
• Scheduling of stochastic tasks on two parallel processors
• Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
• Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan

Cited in

(4)

• Fractional 0-1 programming: applications and algorithms
• Scheduling Jobs with Exponentially Distributed Processing Times on Two Machines with Resource Constraints
• Scheduling two classes of exponential jobs on parallel processors: structural results and worst-case analysis
• Implementation and experiments with an algorithm for parallel scheduling of complex dags under uncertainty (extended abstract)

This page was built for publication: Scheduling tasks with exponential duration on unrelated parallel machines

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