References
- AkkanCKarabatiSThe two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithmEuropean Journal of Operational Research2004159242042910.1016/S0377-2217(03)00415-6
- BellangerAOulamaraAScheduling hybrid flowshop with parallel batching machines and compatibilitiesComputers & Operations Research20093661982199210.1016/j.cor.2008.06.011
- CaoYXuanHLiuJDynamic hybrid flowshop scheduling with batching productionApplied Mechanics and Materials20116556256710.4028/www.scientific.net/AMM.65.562
- ChenHXLuhPBAn alternative framework to Lagrangian relaxation approach for job shop schedulingEuropean Journal of Operational Research2003149349951210.1016/S0377-2217(02)00470-8
- GrahamRLLawlerELLenstraJKRinnooy KanAHGOptimization and approximation in deterministic sequencing and scheduling: A surveyAnnals of Discrete Mathematics1979528732610.1016/S0167-5060(08)70356-X
- GuHYComputation of approximate α-points for large scale single machine scheduling problemComputers & Operations Research200835103262327510.1016/j.cor.2007.02.018
- HeLSunSLuoRA hybrid two-stage flowshop scheduling problemAsia-Pacific Journal of Operational Research2007241455610.1142/S0217595907001036
- IroharaTLagrangian relaxation algorithms for hybrid flow-shop scheduling problems with limited buffersBiomedical Soft Computing and Human Science20101512128
- Jiang S and Tang L (2008). Lagrangian relaxation algorithms for re-entrant hybrid flowshop scheduling. 2008 International Conference on Information Management, Innovation Management and Industrial Engineering, Vol. 1, pp 78–81.
- KimY-DJooB-JShinJ-HHeuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraintJournal of Heuristics2009151194210.1007/s10732-007-9061-z
- LenstraJKRinnooy KanAHGBruckerPComplexity of machine scheduling problemsAnnals of Discrete Mathematics1977134336210.1016/S0167-5060(08)70743-X
- Mahdavi I, Mojarad MS, Javadi B and Tajdin A (2008). A genetic approach for solving a hybrid flow shop scheduling problem. IEEE International Conference on Industrial Engineering and Engineering Management, IEEM, pp 1214–1218.
- Nishi T, Isoya Y and Inuiguchi M (2009). An integrated column generation and Lagrangian relaxation for flowshop scheduling problems. IEEE International Conference on Systems Man and Cybernetics, SMC, pp 299–304.
- NishiTHiranakaYInuiguchiMLagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardinessComputers & Operations Research201037118919810.1016/j.cor.2009.04.008
- TanakaSArakiMA branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machinesInternational Journal of Production Economics2008113144645810.1016/j.ijpe.2007.10.006
- TangLXWangXPAn improved particle swarm optimization algorithm for the hybrid flowshop scheduling to minimize total weighted completion time in process industryIEEE Transactions on Control Systems Technology201018613031314
- TangLXXuanHLiuJYHybrid backward and forward dynamic programming based Lagrangian relaxation for single machine schedulingComputers & Operations Research20073492625263610.1016/j.cor.2005.10.006
- VenturaJARadhakrishnanSSingle machine scheduling with symmetric earliness and tardiness penaltiesEuropean Journal of Operational Research2003144359861210.1016/S0377-2217(02)00163-7
- XuanHTangLXScheduling a hybrid flowshop with batch production at the last stageComputers & Operations Research20073492718273310.1016/j.cor.2005.10.014