A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
- 16 February 2005
- journal article
- research article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 161 (1), 285-291
- https://doi.org/10.1016/j.ejor.2003.09.010
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Makespan minimization in the two‐machine flowshop batch scheduling problemNaval Research Logistics (NRL), 2000
- Scheduling with batching: A reviewEuropean Journal of Operational Research, 2000
- Computational Complexity of Discrete Optimization ProblemsAnnals of Discrete Mathematics, 1979