Parallel-machine scheduling with deteriorating jobs, rejection and a fixed non-availability interval

DOI10.1016/j.amc.2013.07.003zbMath1334.90057OpenAlexW2066648871MaRDI QIDQ278995

Chengxin Luo, Minjiao Zhang

Publication date: 27 April 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2013.07.003

zbMATH Keywords

deteriorating jobsFPTASrejectionmaintenance intervalparallel-machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs ⋮ A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection ⋮ A new approach based on the learning effect for sequence-dependent parallel machine scheduling problem under uncertainty ⋮ Single machine group scheduling with decreasing time-dependent processing times subject to release dates ⋮ Scheduling with Deteriorating Jobs and Non-Simultaneous Machine Available Times ⋮ An uncertain parallel machine problem with deterioration and learning effect ⋮ Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval

This page was built for publication: Parallel-machine scheduling with deteriorating jobs, rejection and a fixed non-availability interval