Pages that link to "Item:Q1599819"

The following pages link to Some comments on sequencing with controllable processing times (Q1599819):

Displaying 28 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)
• Single machine scheduling problems with controllable processing times and total absolute differences penalties (Q856259) (← links)
• Single machine scheduling problem with controllable processing times and resource dependent release times (Q877039) (← 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)
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine (Q954246) (← links)
• Complexity of a scheduling problem with controllable processing times (Q969518) (← links)
• Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
• A unified approach for scheduling with convex resource consumption functions using positional penalties (Q976312) (← links)
• Scheduling two agents with controllable processing times (Q976351) (← links)
• Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity (Q1667833) (← links)
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
• Minimizing the total weighted flow time in a single machine with controllable processing times (Q1886005) (← 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)
• Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach (Q2371348) (← links)
• A survey of scheduling with controllable processing times (Q2381529) (← links)
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← 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)
• 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)
• 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)
• SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION (Q3634181) (← links)
• A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times (Q5949906) (← links)