Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
From MaRDI portal
Publication:1652303
DOI10.1016/j.cor.2017.02.010zbMath1458.90295OpenAlexW2587926306MaRDI QIDQ1652303
Enrique Gerstl, Baruch Mor, Gur Mosheiov
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.02.010
Related Items
Minsum scheduling with acceptable lead-times and optional job rejection, Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation, A survey of job shop scheduling problem: the types and models, Scheduling with competing agents, total late work and job rejection, Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine, Minmax scheduling problems with common due-date and completion time penalty, Flowshop scheduling with learning effect and job rejection, A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection, Minmax due-date assignment on a two-machine flowshop, Single machine lot scheduling with optional job-rejection, Due-window assignment scheduling problem with stochastic processing times, Regular scheduling measures on proportionate flowshop with job rejection, Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Cites Work
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
- A note: minmax due-date assignment problem with lead-time cost
- A survey on offline scheduling with rejection
- Scheduling on parallel identical machines with job-rejection and position-dependent processing times
- On scheduling around large restrictive common due windows
- 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
- A unified approach for scheduling with convex resource consumption functions using positional penalties
- Single machine scheduling and due date assignment with positionally dependent processing times
- Single-machine scheduling with learning considerations
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Single machine group scheduling with position dependent processing times and ready times
- Scheduling problems with position dependent job processing times: computational complexity results
- Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs
- Scheduling with general job-dependent learning curves.
- Single-machine scheduling and due date assignment with rejection and position-dependent processing times
- Minmax due-date assignment with a time window for acceptable lead-times
- An improved heuristic for parallel machine scheduling with rejection
- A due-window assignment problem with position-dependent processing times
- Scheduling jobs with position-dependent processing times
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
