A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
From MaRDI portal
Publication:1388066
DOI10.1023/A:1009626427432zbMath0903.90100MaRDI QIDQ1388066
Mikhail Y. Kovalyov, Wiesław X. Kubiak
Publication date: 5 January 1999
Published in: Journal of Heuristics (Search for Journal in Brave)
Related Items
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, 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, Single Machine Scheduling with an Availability Constraint and Rejection, Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration, Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan, Machine scheduling with job rejection and Dejong's learning effect, Coordination mechanisms for scheduling games with proportional deterioration, The Coordination of Two Parallel Machines Scheduling and Batch Deliveries, Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs, A concise survey of scheduling with time-dependent processing times, Scheduling with time-dependent discrepancy times, Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance, An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration, Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs, A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times, Scheduling jobs with a V-shaped time-dependent processing time, Uniform parallel-machine scheduling with time dependent processing times, Approximation algorithms for some position-dependent scheduling problems, Parallel-batch scheduling with two models of deterioration to minimize the makespan, A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights, Parallel-machine scheduling with simple linear deterioration to minimize total completion time, SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE, A scheduling problem with job values given as a power function of their completion times, Scheduling of deteriorating jobs with release dates to minimize the maximum lateness, Parallel machines scheduling with deteriorating jobs and availability constraints, An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan, Parallel-machine scheduling with deteriorating jobs and rejection, ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation, An approximation algorithm for parallel machine scheduling with simple linear deterioration, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan, Parallel-machine scheduling in shared manufacturing, Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection, Strongly polynomial FPTASes for monotone dynamic programs, A Faster FPTAS for a Supply Chain Scheduling Problem to Minimize Holding Costs with Outsourcing, Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier, 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, Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs
