| 1 |
The k-cardinality assignment problem  |
미소장 |
| 2 |
Choi, B. C., Min, Y. H., Park, M. J. & Kim, K. M. (2020). Production scheduling considering outsourcing options and carrier costs. Journal of Advanced Transportation Article. |
미소장 |
| 3 |
Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals  |
미소장 |
| 4 |
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey  |
미소장 |
| 5 |
Single machine scheduling problems with generalised due-dates and job-rejection  |
미소장 |
| 6 |
Unary NP-hardness of minimizing total weighted tardiness with generalized due dates  |
미소장 |
| 7 |
Scheduling Problems With Generalized Due Dates  |
미소장 |
| 8 |
On the complexity of generalized due date scheduling problems  |
미소장 |
| 9 |
A note on the SPT heuristic for solving scheduling problems with generalized due dates  |
미소장 |
| 10 |
A survey of results for sequencing problems with controllable processing times  |
미소장 |
| 11 |
A note on the generalized due dates scheduling problems  |
미소장 |
| 12 |
Shabtay, D. & Steiner, G. (2018). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155, 1643-1666. |
미소장 |
| 13 |
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches  |
미소장 |
| 14 |
Thomas, D. J. (2015). Matching problems with additional resource constraints. Dissertation. |
미소장 |
| 15 |
Yuan, J. J. (1992). The NP-hardness of the single machine common due date weighted tardiness problem. Systems Science and Mathematical Science, 5, 328-333. |
미소장 |