Pages that link to "Item:Q1603395"
From MaRDI portal
The following pages link to Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. (Q1603395):
Displayed 18 items.
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209) (← links)
- Batch scheduling of identical jobs with controllable processing times (Q336773) (← links)
- Considering manufacturing cost and scheduling performance on a CNC turning machine (Q856225) (← links)
- Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times (Q940868) (← links)
- Complexity of a scheduling problem with controllable processing times (Q969518) (← links)
- Scheduling two agents with controllable processing times (Q976351) (← links)
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (Q1634058) (← links)
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
- Positive half-products and scheduling with controllable processing times (Q1772845) (← links)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- Scheduling with controllable release dates and processing times: total completion time minimization (Q2433441) (← links)
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
- Scheduling with controllable processing times and compression costs using population-based heuristics (Q3168916) (← links)