Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs
From MaRDI portal
(Redirected from Publication:298499)
Recommendations
- Due-date assignment and single machine scheduling with deteriorating jobs
- Scheduling of single machine with deteriorating jobs and due-date assignment
- A note on due-date assignment and single-machine scheduling with deteriorating jobs
- Due-date assignment and parallel-machine scheduling with deteriorating jobs
- An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs
Cites work
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- A note on due-date assignment and single-machine scheduling with deteriorating jobs
- A survey of the state-of-the-art of common due date assignment and scheduling research
- A survey on offline scheduling with rejection
- Algorithms for Scheduling Independent Tasks
- Algorithms for common due-date assignment and sequencing on a single machine with sequence-dependent setup times
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
- Due-date assignment and parallel-machine scheduling with deteriorating jobs
- Due-date assignment and single machine scheduling with deteriorating jobs
- Isomorphic scheduling problems
- Minimizing maximum lateness under linear deterioration
- Minimizing the total weighted completion time of deteriorating jobs
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
- Parallel-machine scheduling with deteriorating jobs, rejection and a fixed non-availability interval
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- Scheduling linear deteriorating jobs with rejection on a single machine
- Scheduling time-dependent jobs under mixed deterioration
- Scheduling two agents with sum-of-processing-times-based deterioration on a single machine
- Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs
- Single-machine due-window assignment problem with learning effect and deteriorating jobs
- Time-dependent scheduling
Cited in
(9)- Scheduling of single machine with deteriorating jobs and due-date assignment
- Due-date assignment and parallel-machine scheduling with deteriorating jobs
- Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs
- Due-date assignment and single machine scheduling with deteriorating jobs
- The due date assignment scheduling problem with the deteriorating jobs and delivery time
- Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs
- An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs
- A note on due-date assignment and single-machine scheduling with deteriorating jobs
- Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs
This page was built for publication: Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q298499)