The minmax due-date assignment problem with acceptable lead-times
From MaRDI portal
Cites work
- A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights
- A note: minmax due-date assignment problem with lead-time cost
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Common due-window assignment for single-machine scheduling with generalized earliness/tardiness penalties and a rate-modifying activity
- Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation
- Minimizing the maximum deviation of job completion time about a common due-date
- Minmax due-date assignment on a two-machine flowshop
- 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
- Mixed integer formulations using natural variables for single machine scheduling around a common due date
- On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Semi-online scheduling on two identical machines with a common due date to maximize total early work
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
This page was built for publication: The minmax due-date assignment problem with acceptable lead-times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030981)
