The two stage assembly flow-shop scheduling problem with batching and delivery

Ahmadizar, 2015, Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs, Comput. Oper. Res., 53, 194, 10.1016/j.cor.2014.08.012 Allahverdi, 2008, The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time, Int. J. Adv. Manuf. Technol., 37, 166, 10.1007/s00170-007-0950-y Allahverdi, 2006, A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application, Comput. Oper. Res., 33, 1056, 10.1016/j.cor.2004.09.002 Allahverdi, 2015, The two stage assembly flowshop scheduling problem to minimize total tardiness, J. Intell. Manuf., 26, 225, 10.1007/s10845-013-0775-5 Atashpaz-Gargari, E., Lucas, C., 2007. Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition. In Evolutionary Computation, 2007. CEC 2007. IEEE Congress on, 4661–4667. Bank, 2012, Two-machine flow shop total tardiness scheduling problem with deteriorating jobs, Appl. Math. Model., 36, 5418, 10.1016/j.apm.2011.12.010 Chen, 1996, Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs, Eur. J. Oper. Res., 93, 49, 10.1016/0377-2217(95)00133-6 Cheng, 1996, Single machine scheduling with batch deliveries, Eur. J. Oper. Res., 94, 277, 10.1016/0377-2217(96)00127-0 Fattahi, 2014, A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations, Appl. Math. Model., 38, 119, 10.1016/j.apm.2013.06.005 García, 2009, A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC’2005 special session on real parameter optimization, J. Heuristics, 15, 617, 10.1007/s10732-008-9080-4 Goldansaz, 2013, A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop, Appl. Math. Model., 37, 9603, 10.1016/j.apm.2013.05.002 Hall, 2001, Generating experimental data for computational testing with machine scheduling applications, Oper. Res., 49, 854, 10.1287/opre.49.6.854.10014 Hall, 2003, Supply chain scheduling: batching and delivery, Oper. Res., 51, 566, 10.1287/opre.51.4.566.16106 Hamidinia, 2012, A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system, Comput. Ind. Eng., 62, 29, 10.1016/j.cie.2011.08.014 Hariri, 1997, A branch and bound algorithm for the two-stage assembly scheduling problem, Eur. J. Oper. Res., 103, 547, 10.1016/S0377-2217(96)00312-8 Herrmann, 1993, On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date, Eur. J. Oper. Res., 70, 272, 10.1016/0377-2217(93)90239-J Khalili, 2015, A bi-objective imperialist competitive algorithm for no-wait flexible flow lines with sequence dependent setup times, Int. J. Adv. Manuf. Technol., 76, 461, 10.1007/s00170-014-6305-6 Kim, 1993, A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops, Comput. Oper. Res., 20, 391, 10.1016/0305-0548(93)90083-U Lee, 1993, Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem, Manag. Sci., 39, 616, 10.1287/mnsc.39.5.616 Lin, 2003, A case study in a two-stage hybrid flow shop with setup time and dedicated machines, Int. J. Prod. Econ., 86, 133, 10.1016/S0925-5273(03)00011-2 Mahdavi Mazdeh, 2013, Minimizing maximum tardiness and delivery costs in a batched delivery system, Comput. Ind. Eng., 66, 675, 10.1016/j.cie.2013.09.014 Mazdeh, 2014, A branch-and-bound algorithm for two-machine flow-shop scheduling problems with batch delivery costs, Int. J. Syst. Sci.: Oper. Logist., 1, 94 Mazdeh, 2007, A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs, Eur. J. Oper. Res., 183, 74, 10.1016/j.ejor.2006.09.087 Mirsanei, 2010, A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times, J. Intell. Manuf., 22, 965, 10.1007/s10845-009-0373-8 Navaei, 2014, Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs, Comput. Oper. Res., 44, 52, 10.1016/j.cor.2013.10.008 Navaei, 2013, Two-stage flow-shop scheduling problem with non-identical second stage assembly machines, Int. J. Adv. Manuf. Technol., 69, 2215, 10.1007/s00170-013-5187-3 Pakzad-Moghaddam, 2014, An approach for modeling a new single machine scheduling problem with deteriorating and learning effects, Comput. Ind. Eng., 78, 33, 10.1016/j.cie.2014.09.021 Potts, 1995, The two-stage assembly scheduling problem: complexity and approximation, Oper. Res., 43, 346, 10.1287/opre.43.2.346 Pundoor, 2005, Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost, Nav. Res. Logist., 52, 571, 10.1002/nav.20100 Rostami, 2015, Minimizing maximum tardiness and delivery costs with batch delivery and job release times, Appl. Math. Model., 39, 4909, 10.1016/j.apm.2015.03.052 Shokrollahpour, 2011, A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem, Int. J. Prod. Res., 49, 3087, 10.1080/00207540903536155 Solano-Charris, 2009, Ant colony optimization algorithm for a Bi-criteria 2-stage hybrid flowshop scheduling problem, J. Intell. Manuf., 22, 815, 10.1007/s10845-009-0370-y Soukhal, 2005, Complexity of flow shop scheduling problems with transportation constraints, Eur. J. Oper. Res., 161, 32, 10.1016/j.ejor.2003.03.002 Sung, 2009, Makespan minimization for a 2-stage assembly scheduling problem subject to component available time constraint, Int. J. Prod. Econ., 119, 392, 10.1016/j.ijpe.2009.03.012 Sung, 2008, A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times, Int. J. Prod. Econ., 113, 1038, 10.1016/j.ijpe.2007.12.007 Torabzadeh, 2010, Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop, Adv. Eng. Softw., 41, 1238, 10.1016/j.advengsoft.2010.06.004 Tozkapan, 2003, A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem, Comput. Oper. Res., 30, 309, 10.1016/S0305-0548(01)00098-3 Wang, 2000, Parallel machine scheduling with batch delivery costs, Int. J. Prod. Econ., 68, 177, 10.1016/S0925-5273(99)00105-X Yin, 2013, Single-machine batch delivery scheduling with an assignable common due date and controllable processing times, Comput. Ind. Eng., 65, 652, 10.1016/j.cie.2013.05.003 Yin, 2012, Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost, Comput. Ind. Eng., 63, 223, 10.1016/j.cie.2012.02.015