Pages that link to "Item:Q2381529"

The following pages link to A survey of scheduling with controllable processing times (Q2381529):

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)
• Batch scheduling of identical jobs with controllable processing times (Q336773) (← links)
• An analysis of the non-preemptive mixed-criticality match-up scheduling problem (Q341470) (← links)
• Adaptive online scheduling of tasks with anytime property on heterogeneous resources (Q342556) (← links)
• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• A survey on offline scheduling with rejection (Q398830) (← links)
• Minimizing makespan in an ordered flow shop with machine-dependent processing times (Q411247) (← links)
• A multi-stage stochastic programming approach in master production scheduling (Q421590) (← links)
• Supply chain scheduling to minimize holding costs with outsourcing (Q490179) (← links)
• Resource constrained scheduling with general truncated job-dependent learning effect (Q511713) (← links)
• An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach (Q520264) (← links)
• Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness (Q613514) (← links)
• Single machine scheduling with total tardiness criterion and convex controllable processing times (Q646664) (← links)
• Considerations of single-machine scheduling with deteriorating jobs (Q651712) (← links)
• Robust resource allocations in temporal networks (Q715076) (← links)
• Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
• Note on the time complexity of resource constrained scheduling with general truncated job-dependent learning effect (Q830922) (← links)
• Scheduling identical parallel machines and operators within a period based changing mode (Q833547) (← links)
• A strong conic quadratic reformulation for machine-job assignment with controllable processing times (Q833574) (← 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)
• 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)
• Parallel machine match-up scheduling with manufacturing cost considerations (Q969751) (← 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)
• Scheduling two agents with controllable processing times (Q976351) (← 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)
• 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 with time-resource tradeoff via nonlinear programming (Q1040086) (← links)
• Bicriteria robotic operation allocation in a flexible manufacturing cell (Q1040977) (← links)
• Power-aware scheduling for makespan and flow (Q1041350) (← links)
• Flow shop scheduling with flexible processing times (Q1621840) (← links)
• Single-machine group scheduling with processing times dependent on position, starting time and allotted resource (Q1634004) (← links)
• Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times (Q1634027) (← links)
• Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (Q1634058) (← links)
• Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function (Q1652513) (← links)
• Stochastic lot sizing problem with nervousness considerations (Q1652600) (← 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)
• Coke production scheduling problem: a parallel machine scheduling with batch preprocessings and location-dependent processing times (Q1725594) (← links)
• Single machine due window assignment resource allocation scheduling with job-dependent learning effect (Q1743396) (← links)
• Resource cost aware scheduling (Q1750475) (← links)
• Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (Q1752203) (← links)
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)