A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
From MaRDI portal
Publication:4950821
DOI10.1287/opre.47.5.757zbMath0976.90042OpenAlexW2041944550MaRDI QIDQ4950821
Mikhail Y. Kovalyov, Wiesław X. Kubiak
Publication date: 27 February 2001
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.47.5.757
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Machine scheduling with earliness, tardiness and non-execution penalties, Parallel-machine scheduling of simple linear deteriorating jobs, Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs, An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs, Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications, Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval, An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan, A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint, Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines, Just-in-time scheduling for a distributed concrete precast flow shop system, Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration, The symmetric quadratic knapsack problem: approximation and scheduling applications, Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan, Machine scheduling with job rejection and Dejong's learning effect, Just-in-Time Scheduling with Equal-Size Jobs, An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration, Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates, A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios, Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties, Parallel-machine scheduling with simple linear deterioration to minimize total completion time, MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK, Parallel machines scheduling with deteriorating jobs and availability constraints, Minimization of ordered, symmetric half-products, Minimizing weighted mean absolute deviation of job completion times from their weighted mean, A recovering beam search algorithm for the single machine just-in-time scheduling problem, Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications, An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan, Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem, Parallel-machine scheduling with deteriorating jobs and rejection, Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date, FPTAS for half-products minimization with scheduling applications, Approximation algorithms for single machine scheduling with one unavailability period, Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan, Parallel-machine scheduling in shared manufacturing, Non-approximability of just-in-time scheduling, Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection, Single-machine batch scheduling of linear deteriorating jobs, Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval, Fast fully polynomial approximation schemes for minimizing completion time variance, A survey of the state-of-the-art of common due date assignment and scheduling research, Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs
