Pages that link to "Item:Q2470098"

The following pages link to Parallel-machine scheduling with simple linear deterioration to minimize total completion time (Q2470098):

Displaying 46 items.

• Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects (Q336434) (← links)
• Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration (Q385474) (← links)
• Approximation algorithms for parallel machine scheduling with linear deterioration (Q391224) (← links)
• An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration (Q437051) (← links)
• Uniform parallel-machine scheduling with time dependent processing times (Q457550) (← links)
• Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning (Q541440) (← links)
• Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691) (← links)
• Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration (Q621032) (← links)
• Scheduling of deteriorating jobs with release dates to minimize the maximum lateness (Q690456) (← links)
• Parallel-machine scheduling with deteriorating jobs and rejection (Q708217) (← links)
• Parallel-machine scheduling of simple linear deteriorating jobs (Q837167) (← links)
• An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan (Q845960) (← links)
• An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan (Q975438) (← links)
• Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan (Q1038382) (← links)
• A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem (Q1046099) (← links)
• Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration (Q1634051) (← links)
• Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities (Q1652634) (← links)
• Coordination mechanisms for scheduling games with proportional deterioration (Q1694911) (← links)
• Identical parallel machine scheduling with time-dependent processing times (Q1704597) (← links)
• Parallel-batch scheduling with two models of deterioration to minimize the makespan (Q1724245) (← links)
• Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs (Q1944138) (← links)
• Parallel-machine scheduling in shared manufacturing (Q2076469) (← links)
• Minimizing total load on parallel machines with linear deterioration (Q2174916) (← links)
• Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events (Q2242370) (← links)
• An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs (Q2250443) (← links)
• Parallel machines scheduling with deteriorating jobs and availability constraints (Q2257611) (← links)
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
• Single-machine batch scheduling of linear deteriorating jobs (Q2344768) (← links)
• Approximation schemes for scheduling a maintenance and linear deteriorating jobs (Q2358862) (← links)
• A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines (Q2379563) (← links)
• Single-machine scheduling with past-sequence-dependent setup times and general effects of deterioration and learning (Q2439497) (← links)
• Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times (Q2462556) (← links)
• A new approach based on the learning effect for sequence-dependent parallel machine scheduling problem under uncertainty (Q2676000) (← links)
• Scheduling with deteriorating jobs and non-simultaneous machine available times (Q2788530) (← links)
• Makespan minimization on three-machine flow shop with deteriorating jobs (Q2873830) (← links)
• Scheduling position-based deteriorating jobs with multiple rate-modifying activities and past-sequence-dependent delivery times (Q2875636) (← links)
• Single-machine scheduling with proportionally deteriorating jobs subject to availability constraints (Q2920364) (← links)
• (Q3170676) (← links)
• A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times (Q5058834) (← links)
• Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs (Q5059255) (← links)
• Parallel Processing and Applied Mathematics (Q5307339) (← links)
• A note on parallel-machine scheduling with deteriorating jobs (Q5428978) (← links)
• An approximation algorithm for parallel machine scheduling with simple linear deterioration (Q5456305) (← links)
• A variable neighborhood search algorithm for a PET/CT examination scheduling problem considering multi-stage process and deteriorating effect (Q6043106) (← links)
• Parallel-Machine Scheduling with Step-Deteriorating Jobs to Minimize the Total (Weighted) Completion Time (Q6053499) (← links)
• Single-machine time-dependent scheduling with proportional and delivery times (Q6542862) (← links)