Partial dominated schedules and minimizing the total completion time of deteriorating jobs

DOI10.1080/02331934.2013.836647zbMath1282.90076OpenAlexW2006296989MaRDI QIDQ5746677

Krzysztof M. Ocetkiewicz

Publication date: 7 February 2014

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2013.836647

zbMATH Keywords

schedulingdeteriorating jobssingle machinetotal completion timenon-dominated schedules

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

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

Cites Work

• A note on scheduling deteriorating jobs
• Dominance made simple
• A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem
• Minimizing the total weighted completion time of deteriorating jobs
• Scheduling in a contaminated area: a model and polynomial algorithms
• Batching work and rework processes with limited deterioration of reworkables
• Solving a permutation problem by a fully polynomial-time approximation scheme
• Scheduling Deteriorating Jobs on a Single Processor
• Scheduling jobs in a contaminated area: a model and heuristic algorithms
• V-Shaped Policies for Scheduling Deteriorating Jobs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling jobs with piecewise linear decreasing processing times
• Scheduling start time dependent jobs to minimize the total weighted completion time

This page was built for publication: Partial dominated schedules and minimizing the total completion time of deteriorating jobs