Single machine scheduling with assignable due dates to minimize maximum and total late work
From MaRDI portal
Publication:6167395
DOI10.1016/j.ejor.2022.10.047OpenAlexW4308448556MaRDI QIDQ6167395
Erwin Pesch, Jan-Erik Justkowiak, Mikhail Y. Kovalyov, Sergey Kovalev
Publication date: 10 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.10.047
Related Items (1)
Cites Work
- Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs
- Coordination of production and interstage batch delivery with outsourced distribution
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Survey of scheduling research involving due date determination decisions
- Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness
- Single machine scheduling with assignable due dates
- The complexity of two group scheduling problems
- Minimizing total late work on a single machine with generalized due-dates
- Optimal testing and repairing a failed series system
- An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
- Two faster algorithms for coordination of production and batch delivery: a note
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
- Single Machine Scheduling to Minimize Total Late Work
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Single Machine Group Scheduling with Two Ordered Criteria
- A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs
This page was built for publication: Single machine scheduling with assignable due dates to minimize maximum and total late work
