Dual-resource flexible job shop scheduling problem considering no-tardiness constraints
Computers & Operations Research
· Elsevier
The publisher did not provide an abstract — full text is available via the link below.
Read at publisher →
Citation
Dual-resource flexible job shop scheduling problem considering no-tardiness constraints. // Computers & Operations Research. – URL: https://www.sciencedirect.com/science/article/pii/S030505482600300X?dgcid=rss_sd_all
Dual-resource flexible job shop scheduling problem considering no-tardiness constraints. Computers & Operations Research. https://www.sciencedirect.com/science/article/pii/S030505482600300X?dgcid=rss_sd_all
“Dual-resource flexible job shop scheduling problem considering no-tardiness constraints.” Computers & Operations Research.
@article{article14530,
title = {Dual-resource flexible job shop scheduling problem considering no-tardiness constraints},
journal = {Computers \& Operations Research},
url = {https://www.sciencedirect.com/science/article/pii/S030505482600300X?dgcid=rss_sd_all}
}