Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Scheduling two-stage hybrid flow shop with availability constraints
Computers and Operations Research
Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints
Computers and Industrial Engineering
Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
Computers & Mathematics with Applications
On scheduling in map-reduce and flow-shops
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Two-stage proportionate flexible flow shop to minimize the makespan
Journal of Combinatorial Optimization
| Hi-index | 5.23 |