A note: minmax due-date assignment problem with lead-time cost
From MaRDI portal
Recommendations
- Minmax due-date assignment with a time window for acceptable lead-times
- Minmax due-date assignment on a two-machine flowshop
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- Optimal due date assignment in multi-machine scheduling environments
Cites work
- scientific article; zbMATH DE number 4172724 (Why is no real title available?)
- A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment
- A note on optimal assignment of slack due-dates in single-machine scheduling
- A note on the SPT heuristic for solving scheduling problems with generalized due dates
- A survey of the state-of-the-art of common due date assignment and scheduling research
- An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness
- Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment
- Job-dependent due-window assignment based on a common flow allowance
- Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
- Minimizing the maximum deviation of job completion time about a common due-date
- On the complexity of generalized due date scheduling problems
- Optimal assignment of slack due-date and sequencing in a single machine shop
- Optimal assignment of slack due-dates and sequencing in a single-machine shop
- Optimal due date assignment in multi-machine scheduling environments
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule
- Single Machine Scheduling with Flow Allowances
- Single machine common flow allowance scheduling with controllable processing times
- Single machine scheduling with assignable due dates
- Two due date assignment problems in scheduling a single machine
- Two-machine flow-shop scheduling with rejection
Cited in
(6)- Due-date assignment with acceptable lead-times on parallel machines
- Minmax due-date assignment on a two-machine flowshop
- Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine
- Minmax due-date assignment with a time window for acceptable lead-times
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
- Minsum scheduling with acceptable lead-times and optional job rejection
This page was built for publication: A note: minmax due-date assignment problem with lead-time cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336460)
