Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs
From MaRDI portal
Publication:298499
DOI10.1016/j.amc.2014.09.095zbMath1338.90190OpenAlexW2077694924MaRDI QIDQ298499
Shuenn-Ren Cheng, Chou-Jung Hsu, Chin-Chia Wu, Yunqiang Yin, Chuan-Li Zhao
Publication date: 20 June 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.09.095
Related Items
An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs, Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs, The due date assignment scheduling problem with the deteriorating jobs and delivery time, Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs
Cites Work
- Parallel-machine scheduling with deteriorating jobs, rejection and a fixed non-availability interval
- A survey on offline scheduling with rejection
- Single-machine due-window assignment problem with learning effect and deteriorating jobs
- Isomorphic scheduling problems
- Time-dependent scheduling
- Scheduling linear deteriorating jobs with rejection on a single machine
- Scheduling time-dependent jobs under mixed deterioration
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Minimizing the total weighted completion time of deteriorating jobs
- Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs
- Scheduling two agents with sum-of-processing-times-based deterioration on a single machine
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
- Algorithms for common due-date assignment and sequencing on a single machine with sequence-dependent setup times
- Scheduling Deteriorating Jobs on a Single Processor
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Algorithms for Scheduling Independent Tasks
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
- Due-date assignment and single machine scheduling with deteriorating jobs
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- A note on due-date assignment and single-machine scheduling with deteriorating jobs
- Due-date assignment and parallel-machine scheduling with deteriorating jobs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Minimizing maximum lateness under linear deterioration
