Pages that link to "Item:Q992654"

The following pages link to ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (Q992654):

Displaying 23 items.

• An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
• Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria (Q337198) (← links)
• Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration (Q385474) (← links)
• Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691) (← links)
• A generic approach to proving NP-hardness of partition type problems (Q608273) (← links)
• Optimal composition ordering problems for piecewise linear functions (Q724224) (← links)
• Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions (Q1652152) (← links)
• Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine (Q1694914) (← links)
• Computing dense tensor decompositions with optimal dimension trees (Q1741867) (← links)
• A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan (Q1991261) (← links)
• Parallel-batch scheduling with deterioration and rejection on a single machine (Q2194699) (← links)
• Parallel machines scheduling with deteriorating jobs and availability constraints (Q2257611) (← links)
• Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
• Single-machine batch scheduling of linear deteriorating jobs (Q2344768) (← links)
• The list scheduling algorithm for scheduling unreliable jobs on two parallel machines (Q2448904) (← links)
• The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines (Q2661490) (← links)
• Replication and sequencing of unreliable jobs on parallel machines (Q2669802) (← links)
• Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan (Q2956870) (← links)
• The Complexity of Contracts (Q5856150) (← links)
• A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum (Q6045460) (← links)
• Arithmetic Expression Construction. (Q6065408) (← links)
• The Complexity of Aggregates over Extractions by Regular Expressions (Q6135782) (← links)