Pages that link to "Item:Q1885985"

The following pages link to Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine (Q1885985):

Displaying 23 items.

• 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)
• Optimal due date assignment and resource allocation in a group technology scheduling environment (Q991385) (← links)
• Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← 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)
• Scheduling a batching machine with convex resource consumption functions (Q1944176) (← 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)
• Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine (Q2434305) (← links)
• A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates (Q2489138) (← links)
• Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
• Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times (Q3455877) (← links)
• Scheduling parallel dedicated machines with the speeding‐up resource (Q5393022) (← links)
• Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity (Q5744000) (← links)