1. Ashour S (1967) A decomposition approach for the machine scheduling problem. Int J Prod Res 6(2):109–122
2. Aphirak K, Sirikarn C, Thatchai T, Peeraya T, Warattapop C, Pupong P (2012) Application of firefly algorithm and its parameter setting for job shop scheduling. J Ind Technol 8(1):89–97
3. Bin Q, Ling W, De Xian H, Xiong W (2009) Multi-objective no-wait flow-shop scheduling with a memetic algorithm based on differential evolution. Soft Comput 13(8–9):847–869
4. Binchao C, Timothy I (2013) A flexible dispatching rule for minimizing tardiness in job shop scheduling. Int J Prod Econ 144(1):360–365
5. Boxma O, Forst F (1986) Minimizing the expected weighted number of tardy jobs in stochastic flow shops. Oper Res Lett 5(3):119–126