Online scheduling to minimize total weighted (modified) earliness and tardiness cost.
- Published in:
- Journal of Scheduling, 2021, v. 24, n. 4, p. 431, doi. 10.1007/s10951-021-00698-3
- By:
- Publication type:
- Article
Works matching IS 10946136 AND DT 2021 AND VI 24 AND IP 4
Results: 6
1
2
A memetic algorithm to address the multi-node resource-constrained project scheduling problem.
- Published in:
- Journal of Scheduling, 2021, v. 24, n. 4, p. 413, doi. 10.1007/s10951-021-00696-5
- By:
- Publication type:
- Article
3
A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing.
- Published in:
- Journal of Scheduling, 2021, v. 24, n. 4, p. 405, doi. 10.1007/s10951-021-00694-7
- By:
- Publication type:
- Article
4
A note on the complexity of two supply chain scheduling problems.
- Published in:
- Journal of Scheduling, 2021, v. 24, n. 4, p. 447, doi. 10.1007/s10951-021-00692-9
- By:
- Publication type:
- Article
5
Scheduling with gaps: new models and algorithms.
- Published in:
- Journal of Scheduling, 2021, v. 24, n. 4, p. 381, doi. 10.1007/s10951-021-00691-w
- By:
- Publication type:
- Article
6
Routing two stacking cranes with predetermined container sequences.
- Published in:
- Journal of Scheduling, 2021, v. 24, n. 4, p. 367, doi. 10.1007/s10951-021-00689-4
- By:
- Publication type:
- Article