Pages that link to "Item:Q4950821"

The following pages link to A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem (Q4950821):

Displaying 47 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)
• Minimizing weighted mean absolute deviation of job completion times from their weighted mean (Q548013) (← links)
• Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates (Q640300) (← links)
• A half-product based approximation scheme for agreeably weighted completion time variance (Q707130) (← links)
• Parallel-machine scheduling with deteriorating jobs and rejection (Q708217) (← links)
• Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date (Q708332) (← links)
• Parallel-machine scheduling of simple linear deteriorating jobs (Q837167) (← links)
• Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
• An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan (Q845960) (← links)
• A faster fully polynomial approximation scheme for the single-machine total tardiness problem (Q958114) (← links)
• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) (← links)
• An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan (Q975438) (← links)
• FPTAS for half-products minimization with scheduling applications (Q1005250) (← links)
• Approximation algorithms for single machine scheduling with one unavailability period (Q1022445) (← links)
• Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan (Q1038382) (← links)
• Non-approximability of just-in-time scheduling (Q1041346) (← links)
• Fast fully polynomial approximation schemes for minimizing completion time variance (Q1600838) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• Minimization of ordered, symmetric half-products (Q1763481) (← links)
• Machine scheduling with earliness, tardiness and non-execution penalties (Q1886873) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios (Q1956478) (← links)
• Parallel-machine scheduling in shared manufacturing (Q2076469) (← links)
• Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties (Q2228360) (← links)
• Parallel machines scheduling with deteriorating jobs and availability constraints (Q2257611) (← 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)
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time (Q2470098) (← links)
• A recovering beam search algorithm for the single machine just-in-time scheduling problem (Q2488909) (← links)
• Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (Q2491772) (← links)
• An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs (Q2628167) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• Just-in-time scheduling for a distributed concrete precast flow shop system (Q2668621) (← links)
• Improving the solution complexity of the scheduling problem with deadlines: A general technique (Q2954334) (← links)
• Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan (Q2956870) (← links)
• Just-in-Time Scheduling with Equal-Size Jobs (Q2958671) (← links)
• MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK (Q3569281) (← links)
• A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work (Q4294731) (← links)
• Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168) (← links)
• (Q4841013) (← 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)
• 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)