Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs
From MaRDI portal
Publication:263077
DOI10.1007/s13160-015-0205-5zbMath1333.90056OpenAlexW2222505517MaRDI QIDQ263077
Publication date: 4 April 2016
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-015-0205-5
Related Items
Cites Work
- Unnamed Item
- Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs
- Four single-machine scheduling problems involving due date determination decisions
- A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- 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
- A note on ``Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
- The single-machine total tardiness problem with unequal release times and a linear deterioration
- 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
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
