Pages that link to "Item:Q1413814"

The following pages link to Single machine scheduling with a variable common due date and resource-dependent processing times. (Q1413814):

Displaying 30 items.

• A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models (Q660815) (← links)
• Preemptive repayment policy for multiple loans (Q763209) (← links)
• Single machine scheduling problems with controllable processing times and total absolute differences penalties (Q856259) (← links)
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times (Q892912) (← links)
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times (Q940868) (← links)
• Minimizing the number of late jobs for the permutation flowshop problem with secondary resources (Q941545) (← links)
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine (Q954246) (← links)
• A scheduling problem with job values given as a power function of their completion times (Q954933) (← 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 unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times (Q976475) (← links)
• Optimal control of production processes with variable execution times (Q977002) (← 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)
• Scheduling under common due date, a single resource and precedence constraints -- a dynamic approach (Q1273543) (← links)
• Single machine earliness-tardiness scheduling with resource-dependent release dates (Q1847239) (← links)
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
• Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms (Q2298093) (← 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)
• A new approach to the learning effect: Beyond the learning curve restrictions (Q2483519) (← links)
• Single machine scheduling with common due date and controllable processing times (Q2489364) (← links)
• Single machine common flow allowance scheduling with controllable processing times (Q2504094) (← links)
• Single CNC machine scheduling with controllable processing times and multiple due dates (Q3605428) (← links)
• Minimax scheduling problem with common due-date and controlled processing times and resource restriction (Q5127570) (← links)
• A heuristic for single machine common due date assignment problem with different earliness/tardiness weights (Q6059906) (← links)
• Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs (Q6112732) (← links)