References
- Al-AnziFAllahverdiAThe relationship between three tiered client-server internet database connectivity and two-machine flowshopInt J Dist Sys Net2001494101
- AllahverdiAMinimizing mean flowtime in a two-machine flowshop with sequence-independent setup timesComput Opns Res20002711112710.1016/S0305-0548(99)00010-6
- AllahverdiAAl-AnziFA branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup timesEur J Opl Res200616976778010.1016/j.ejor.2004.07.074
- AllahverdiASoroushHMThe significance of reducing setup times/setup costsEur J Opl Res200818797898410.1016/j.ejor.2006.09.010
- AllahverdiANgCTChengTCEKovalyov MikhailYA survey of scheduling problems with setup times or costsEur J Opl Res2008187985103210.1016/j.ejor.2006.06.060
- BaggaPCKhuranaKTwo-machine flowshop with separated sequence-independent setup times: Mean completion criterionIndian J Manage Syst198624757
- BahrounZMoallaMBaazaouiGCampagneJPMulti-agent modelling for replenishment policies simulation in supply chainsEur J Ind Eng2010445047010.1504/EJIE.2010.035654
- DathTNSRajendranCNarashimanKAn empirical study on supply chain management in India: The perspective of original equipment manufacturers and suppliersEur J Ind Eng2010423910.1504/EJIE.2010.029568
- GareyMRJohnsonDSComputers and Intractability: A Guide to the Theory of NP-Completeness1979
- GharbiALadhariTMsakniMKSerairiMPolynomial lower bounds for the two-machine flowshop problem with sequence-independent setup timesElecto Notes Discret Math2010361089109610.1016/j.endm.2010.05.138
- JohnsonSMOptimal two- and three-stage production schedules with setup times includedNav Res Log Quart19541698110.1002/nav.3800010110
- LehouxND'AmoursSLangevinAA win-win collaboration approach for a two-echelon supply chain: A case study in the pulp and paper industryEur J Ind Eng2010449351410.1504/EJIE.2010.035656
- Msakni MK, Ladhari T and Allahverdi A (2009). Heuristic algorithms for minimizing total completion time in a two-machine flowshop with sequence-independent setup times. Comput Ind Eng: 90–95.
- MurataTIshibuchiHTanakaHGenetic algorithms for flowshop scheduling problemsComput Ind Eng1996301061107110.1016/0360-8352(96)00053-8
- NawazMEnscoreEEHamIA heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOMEGA198311919510.1016/0305-0483(83)90088-9
- NowickiESmutnickiCA fast tabu search algorithm for the permutation flow-shop problemEur J Opl Res19969116017510.1016/0377-2217(95)00037-2
- ReevesCYamadaTGenetic algorithms, path relinking, and the flowshop sequencing problemEvol Computation19986456010.1162/evco.1998.6.1.45
- RuizRAllahverdiASome effective heuristics for no-wait flowshops with setup times to minimize total completion timeAnn Opns Res200715614317110.1007/s10479-007-0227-8
- SharmaSOn price increases and temporary price reductions with partial backorderingEur J Ind Eng20093708910.1504/EJIE.2009.021585
- SinghOPChandSSupply chain design in the electronics industry incorporating JIT purchasingEur J Ind Eng20093214410.1504/EJIE.2009.021583
- TsengLYLinYTHybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimizationEur J Opl Res200919686987610.1016/j.ejor.2008.04.033
- WarburtonRDHEOQ extensions exploiting the Lambert W functionEur J Ind Eng20093456910.1504/EJIE.2009.021584