Minmax due-date assignment with a time window for acceptable lead-times
From MaRDI portal
Publication:2449349
DOI10.1007/s10479-013-1458-5zbMath1286.90081MaRDI QIDQ2449349
Publication date: 8 May 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-013-1458-5
90C47: Minimax problems in mathematical programming
90B35: Deterministic scheduling theory in operations research
90B80: Discrete location and assignment
Related Items
Due-window assignment scheduling problems with position-dependent weights on a single machine, Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine, Due-window assignment scheduling in the proportionate flow shop setting, 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, Minmax due-date assignment on a two-machine flowshop, Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times
Cites Work
- A note: minmax due-date assignment problem with lead-time cost
- Scheduling on parallel identical machines with job-rejection and position-dependent processing times
- Optimal due date assignment in multi-machine scheduling environments
- Two due date assignment problems in scheduling a single machine
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- Minimizing the maximum deviation of job completion time about a common due-date
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Common due window size and location determination in a single machine scheduling problem
- Sequencing with Earliness and Tardiness Penalties: A Review
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Single Machine Scheduling with Flow Allowances