Pages that link to "Item:Q5749161"

The following pages link to Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions (Q5749161):

Displaying 39 items.

• Resource constrained scheduling with general truncated job-dependent learning effect (Q511713) (← links)
• Single machine scheduling with total tardiness criterion and convex controllable processing times (Q646664) (← links)
• Single machine batch scheduling to minimize total completion time and resource consumption costs (Q835561) (← links)
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times (Q940868) (← links)
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine (Q954246) (← links)
• Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
• A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates (Q976008) (← links)
• A unified approach for scheduling with convex resource consumption functions using positional penalties (Q976312) (← links)
• A search method for optimal control of a flow shop system of traditional machines (Q976446) (← links)
• A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times (Q976475) (← links)
• Descent methods for convex essentially smooth minimization (Q1321119) (← links)
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
• Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity (Q1667833) (← links)
• Optimal workforce assignment to operations of a paced assembly line (Q1694335) (← links)
• Resource cost aware scheduling (Q1750475) (← links)
• Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (Q1752203) (← links)
• The resource dependent assignment problem with a convex agent cost function (Q1753596) (← links)
• Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time (Q1761997) (← links)
• Convex resource allocation for minimizing the makespan in a single machine with job release dates (Q1881652) (← links)
• Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine (Q1885985) (← links)
• Minimizing the total weighted flow time in a single machine with controllable processing times (Q1886005) (← links)
• Scheduling a batching machine with convex resource consumption functions (Q1944176) (← links)
• Single-machine scheduling with resource-dependent processing times and multiple unavailability periods (Q2142677) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• Inverse interval scheduling via reduction on a single machine (Q2158006) (← links)
• Single-machine scheduling with machine unavailability periods and resource dependent processing times (Q2242291) (← 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)
• A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates (Q2430605) (← links)
• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249) (← links)
• Scheduling with due date assignment under special conditions on job processing (Q2434296) (← links)
• Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine (Q2434305) (← links)
• Minimizing task completion time with the execution set method (Q2467305) (← links)
• Scheduling malleable tasks with interdependent processing rates: comments and observations (Q2476250) (← links)
• A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates (Q2489138) (← links)
• Parallel machine scheduling with a convex resource consumption function (Q2491771) (← links)
• Coupled task scheduling with convex resource consumption functions (Q2659170) (← links)
• Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect (Q2954339) (← links)
• Bicriterion scheduling with truncated learning effects and convex controllable processing times (Q6070521) (← links)