Pages that link to "Item:Q1388066"

The following pages link to A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs (Q1388066):

Displaying 44 items.

• Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs (Q263077) (← links)
• Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs (Q298499) (← links)
• Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration (Q385474) (← 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)
• 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)
• A scheduling problem with job values given as a power function of their completion times (Q954933) (← links)
• An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan (Q975438) (← links)
• ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (Q992654) (← links)
• Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan (Q1038382) (← links)
• A concise survey of scheduling with time-dependent processing times (Q1410319) (← links)
• Coordination mechanisms for scheduling games with proportional deterioration (Q1694911) (← links)
• Scheduling with time-dependent discrepancy times (Q1702735) (← links)
• Parallel-batch scheduling with two models of deterioration to minimize the makespan (Q1724245) (← links)
• A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights (Q1742901) (← links)
• Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs (Q1944138) (← links)
• Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs (Q1955358) (← links)
• Parallel-machine scheduling in shared manufacturing (Q2076469) (← links)
• Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
• A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times (Q2215197) (← links)
• Scheduling jobs with a V-shaped time-dependent processing time (Q2215205) (← links)
• Approximation algorithms for some position-dependent scheduling problems (Q2217459) (← 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)
• Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection (Q2331597) (← links)
• Single-machine batch scheduling of linear deteriorating jobs (Q2344768) (← links)
• Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval (Q2346517) (← links)
• Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance (Q2434334) (← links)
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time (Q2470098) (← links)
• An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs (Q2628167) (← links)
• Single Machine Scheduling with an Availability Constraint and Rejection (Q2931173) (← links)
• Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan (Q2956870) (← links)
• The Coordination of Two Parallel Machines Scheduling and Batch Deliveries (Q3511379) (← links)
• SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE (Q4649880) (← links)
• Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
• A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint (Q5059405) (← links)
• An approximation algorithm for parallel machine scheduling with simple linear deterioration (Q5456305) (← links)
• A Faster FPTAS for a Supply Chain Scheduling Problem to Minimize Holding Costs with Outsourcing (Q5506759) (← links)
• Machine scheduling with job rejection and Dejong's learning effect (Q6112831) (← links)
• A unified approach to single-machine scheduling with position-based processing times, machine availability, and job rejection (Q6544919) (← links)
• Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times (Q6577340) (← links)