Pages that link to "Item:Q908846"

The following pages link to A survey of results for sequencing problems with controllable processing times (Q908846):

Displaying 50 items.

• Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209) (← links)
• Scheduling under linear constraints (Q323163) (← links)
• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
• An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach (Q520264) (← links)
• Single machine scheduling with resource dependent release times and processing times (Q704120) (← links)
• Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
• Sequencing games with controllable processing times (Q818079) (← links)
• Single machine batch scheduling to minimize total completion time and resource consumption costs (Q835561) (← links)
• Single-machine scheduling with trade-off between number of tardy jobs and compression cost (Q835563) (← links)
• Considering manufacturing cost and scheduling performance on a CNC turning machine (Q856225) (← 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)
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times (Q892912) (← links)
• Preemptive scheduling on uniform parallel machines with controllable job processing times (Q930610) (← 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 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)
• 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 jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis (Q1186948) (← links)
• Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs (Q1288216) (← links)
• Two parallel machine sequencing problems involving controllable job processing times (Q1310019) (← links)
• An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times (Q1310020) (← links)
• An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times (Q1319563) (← links)
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (Q1362988) (← links)
• Single machine scheduling with discretely controllable processing times (Q1373460) (← links)
• Single machine scheduling with a variable common due date and resource-dependent processing times. (Q1413814) (← links)
• Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. (Q1603395) (← links)
• Flow shop scheduling with flexible processing times (Q1621840) (← links)
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
• A genetic algorithm-based approach for single-machine scheduling with learning effect and release time (Q1717946) (← links)
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
• Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time (Q1761997) (← links)
• Minimizing completion time variance with compressible processing times (Q1781972) (← links)
• An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note (Q1867103) (← links)
• Approximation schemes for parallel machine scheduling problems with controllable processing times (Q1885962) (← links)
• A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times (Q1917233) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• Proportionate flow shop with controllable processing times (Q1964482) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• Single machine scheduling with rejection to minimize the weighted makespan (Q2151365) (← links)
• Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost (Q2174270) (← 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)
• Single-machine scheduling with time-and-resource-dependent processing times (Q2428936) (← links)
• Scheduling with controllable release dates and processing times: Makespan minimization (Q2433440) (← links)
• Scheduling with controllable release dates and processing times: total completion time minimization (Q2433441) (← links)