A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem

DOI10.1016/J.EJOR.2009.07.025MaRDI QIDQ1046099zbMATH OpenOpenAlexFDO

Authors Krzysztof Ocetkiewicz

Publication date 21 December 2009

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2009.07.025

zbMATH Keywords

deteriorating jobsFPTASschedulingsingle machinetotal completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 6378894
• An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time
• An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
• Single-machine total completion time scheduling with a time-dependent deterioration

Cites work

• A concise survey of scheduling with time-dependent processing times
• A state-of-the-art review on scheduling with learning effects
• Complexity analysis of job-shop scheduling with deteriorating jobs
• Designing PTASs for MIN-SUM scheduling problems
• scientific article; zbMATH DE number 2086777 (Why is no real title available?)
• Parallel machine scheduling with time dependent processing times
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time
• Scheduling Deteriorating Jobs on a Single Processor
• Scheduling with time dependent processing times: Review and extensions
• V-Shaped Policies for Scheduling Deteriorating Jobs
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

Cited in

(6)

• Minimizing total load on parallel machines with linear deterioration
• New results for an open time-dependent scheduling problem
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• An FPTAS of minimizing total weighted completion time on single machine with position constraint
• Partial dominated schedules and minimizing the total completion time of deteriorating jobs
• An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs

This page was built for publication: A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1046099)