A note: minmax due-date assignment problem with lead-time cost
From MaRDI portal
Publication:336460
DOI10.1016/j.cor.2013.03.004zbMath1348.90293OpenAlexW2079438867MaRDI QIDQ336460
Baruch Mor, Dvir Shabtay, Gur Mosheiov
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.03.004
Minimax problems in mathematical programming (90C47) Deterministic scheduling theory in operations research (90B35)
Related Items
Minsum scheduling with acceptable lead-times and optional job rejection, Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection, 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 due-date assignment on a two-machine flowshop
Cites Work
- Unnamed Item
- Unnamed Item
- A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- Optimal assignment of slack due-date and sequencing in a single machine shop
- Optimal due date assignment in multi-machine scheduling environments
- Two due date assignment problems in scheduling a single machine
- Optimal assignment of slack due-dates and sequencing in a single-machine shop
- Minimizing the maximum deviation of job completion time about a common due-date
- An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem
- On the complexity of generalized due date scheduling problems
- 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
- 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
- Single machine scheduling with assignable due dates
- Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
- Two-machine flow-shop scheduling with rejection
- Single machine common flow allowance scheduling with controllable processing times
- Sequencing with Earliness and Tardiness Penalties: A Review
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule
- Single Machine Scheduling with Flow Allowances
