### 5 papers:

- DATE-2015-WaqasGKSBSVC #heuristic #online #scalability #scheduling
- A re-entrant flowshop heuristic for online scheduling of the paper path in a large scale printer (UW, MG, JK, LJS, TB, SS, PV, HC), pp. 573–578.
- ICALP-v1-2013-MuchaS #problem #scheduling #symmetry
- No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem (MM, MS), pp. 769–779.
- CASE-2010-JingL #assembly #hybrid #scheduling
- A MILP-based batch scheduling for two-stage hybrid flowshop with sequence-dependent setups in semiconductor assembly and test manufacturing (XJ, ZL), pp. 87–92.
- CASE-2007-NishiHI #problem #scheduling
- A Successive Lagrangian Relaxation Method for Solving Flowshop Scheduling Problems with Total Weighted Tardiness (TN, YH, MI), pp. 875–880.
- CASE-2006-ChandrasekaranSPV #algorithm #optimisation #permutation #problem #scheduling
- An Application of Particle Swarm Optimization Algorithm to Permutation Flowshop Scheduling Problems to Minimize Makespan, Total Flowtime and Completion Time Variance (SC, RKS, SGP, NV), pp. 513–518.