Due-date assignment with acceptable lead-times on parallel machines
From MaRDI portal
Publication:6568406
DOI10.1016/J.COR.2024.106617MaRDI QIDQ6568406
Publication date: 8 July 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Optimal restricted due date assignment in scheduling
- A note: minmax due-date assignment problem with lead-time cost
- A survey on offline scheduling with rejection
- 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
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
- Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs
- Single machine lot scheduling with optional job-rejection
- Minsum scheduling with acceptable lead-times and optional job rejection
- A general scheme for solving a large set of scheduling problems with rejection in FPT time
- A greedy heuristic for solving scheduling problems with bounded rejection cost
- Scheduling of two-machine flowshop with outsourcing lead-time
- Single machine scheduling with non-availability interval and optional job rejection
- Minmax due-date assignment on a two-machine flowshop
- Research on single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
- Scheduling with competing agents, total late work and job rejection
- A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Single Machine Scheduling with Flow Allowances
- A common due-data assignment problem on parallel identical machines
This page was built for publication: Due-date assignment with acceptable lead-times on parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568406)