Pages that link to "Item:Q1186924"
From MaRDI portal
The following pages link to Scheduling to minimize weighted earliness and tardiness about a common due-date (Q1186924):
Displaying 25 items.
- A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date (Q856323) (← links)
- Group sequencing around a common due date (Q937402) (← links)
- A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines (Q1040984) (← links)
- Scheduling around a small common due date (Q1183621) (← links)
- On the general solution for a class of early/tardy problems (Q1207204) (← links)
- Common due date scheduling problem with separate earliness and tardiness penalties (Q1207207) (← links)
- Scheduling about a given common due date to minimize mean squared deviation of completion times (Q1266598) (← links)
- A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems (Q1278309) (← links)
- A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date (Q1278532) (← links)
- Single machine \(\text{MAD}/T_{\max}\) problem with a common due date (Q1348560) (← links)
- The complexity of scheduling job families about a common due date (Q1376265) (← links)
- Scheduling shops to minimize the weighted number of late jobs (Q1890952) (← links)
- A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios (Q1956478) (← links)
- Online scheduling to minimize total weighted (modified) earliness and tardiness cost (Q2059092) (← links)
- Dominance inequalities for scheduling around an unrestrictive common due date (Q2242293) (← links)
- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine (Q2429059) (← links)
- An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs (Q2483505) (← links)
- Determination of fault-tolerant fabric-cutting schedules in a just-in-time apparel manufacturing environment (Q3430238) (← links)
- Single- and multiple-processor models for minimizing completion time variance (Q3735434) (← links)
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date (Q3806975) (← links)
- Optimal scheduling of jobs about a common due date on a single machine (Q3986089) (← links)
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date (Q3988910) (← links)
- Application of genetic algorithm to stochastic single machine scheduling problem with earliness and tardiness costs (Q4243262) (← links)
- Earliness-Tardiness Scheduling Around Almost Equal Due Dates (Q4367046) (← links)
- Due-date assignment with asymmetric earliness–tardiness cost (Q4661193) (← links)
