Scheduling tasks with exponential duration on unrelated parallel machines

DOI10.1016/j.dam.2012.06.010zbMath1248.68121OpenAlexW2124766050MaRDI QIDQ714038

Mohammad Ghodsi, Mostafa Nouri

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 graphNP-hardmultiple choice hyperbolic 0-1 programmingstochastic parallel scheduling

Mathematics Subject Classification ID

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

Related Items

Fractional 0-1 programming: applications and algorithms

Cites Work

• Hyperbolic 0-1 programming and query optimization in information retrieval
• NP-complete scheduling problems
• Project scheduling under uncertainty: survey and research potentials
• On complexity of unconstrained hyperbolic 0--1 programming problems
• A decomposition theorem for partially ordered sets
• 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
• 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
• Complexity of Scheduling under Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• (0, 1) hyperbolic programming problems
• Scheduling
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item