Pages that link to "Item:Q867932"
From MaRDI portal
The following pages link to Two due date assignment problems in scheduling a single machine (Q867932):
Displaying 39 items.
- Optimal restricted due date assignment in scheduling (Q322834) (← links)
- A note: minmax due-date assignment problem with lead-time cost (Q336460) (← links)
- A note on ``Two-machine flow-shop scheduling with rejection'' and its link with flow-shop scheduling and common due date assignment (Q339677) (← links)
- A survey on offline scheduling with rejection (Q398830) (← links)
- Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine (Q474786) (← links)
- Four single-machine scheduling problems involving due date determination decisions (Q497630) (← links)
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments (Q708343) (← links)
- Optimal due date assignment in multi-machine scheduling environments (Q835592) (← links)
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times (Q940868) (← links)
- A faster algorithm for a due date assignment problem with tardy jobs (Q969519) (← links)
- A unified approach for scheduling with convex resource consumption functions using positional penalties (Q976312) (← links)
- Due dates assignment and JIT scheduling with equal-size jobs (Q976442) (← links)
- The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
- A fixed interval due-date scheduling problem with earliness and due-date costs (Q1127177) (← links)
- Single machine \(\text{MAD}/T_{\max}\) problem with a common due date (Q1348560) (← links)
- Single machine scheduling with assignable due dates (Q1613425) (← links)
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection (Q1652303) (← links)
- On the fixed interval due-date scheduling problem (Q1917349) (← links)
- Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs (Q2018942) (← links)
- Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty (Q2045022) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Minsum scheduling with acceptable lead-times and optional job rejection (Q2119760) (← links)
- Two-agent single-machine scheduling with assignable due dates (Q2250186) (← links)
- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine (Q2429059) (← links)
- Scheduling with due date assignment under special conditions on job processing (Q2434296) (← links)
- Minmax due-date assignment with a time window for acceptable lead-times (Q2449349) (← links)
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function (Q2459388) (← links)
- Due-date assignment on uniform machines (Q2519077) (← links)
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work (Q2673557) (← links)
- TWK due date determination and scheduling: NP-hardness and polynomially solvable case (Q2784173) (← links)
- (Q3690567) (← links)
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date (Q3988911) (← links)
- Bicriteria scheduling for due date assignment with total weighted tardiness (Q4553877) (← links)
- SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT (Q4626601) (← links)
- Due-date assignment with asymmetric earliness–tardiness cost (Q4661193) (← links)
- Proportionate flow shop: New complexity results and models with due date assignment (Q5249462) (← links)
- A new perspective on single-machine scheduling problems with late work related criteria (Q6160955) (← links)
- Due-date assignment with acceptable lead-times on parallel machines (Q6568406) (← links)
- Scheduling a single machine with multiple due dates per job (Q6657886) (← links)