Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
From MaRDI portal
Publication:4632917
DOI10.1002/nav.21684zbMath1411.90132OpenAlexW2343893962MaRDI QIDQ4632917
Du-Juan Wang, Cheng, T. C. Edwin, Yunqiang Yin, Chin-Chia Wu, Jianyou Xu
Publication date: 2 May 2019
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21684
Related Items (17)
Semi-online scheduling on two identical machines with a common due date to maximize total early work ⋮ Pareto-scheduling of two competing agents with their own equal processing times ⋮ Two-machine flow-shop scheduling to minimize total late work: revisited ⋮ Minimizing total weighted late work on a single-machine with non-availability intervals ⋮ Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work ⋮ Scheduling with competing agents, total late work and job rejection ⋮ Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ The study of group scheduling problems with general dual-position-based job processing times ⋮ Single-machine preemptive scheduling with release dates involving the total weighted late work criterion ⋮ A new perspective on single-machine scheduling problems with late work related criteria ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ Minimizing total late work on a single machine with generalized due-dates ⋮ Single-machine common due date total earliness/tardiness scheduling with machine unavailability ⋮ Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ Two-machine flow shop scheduling with a common due date to maximize total early work
This page was built for publication: Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
