Flow shop scheduling is a type of scheduling where sequence follows for each job on a set of machines for processing. In practice, jobs in flow shops can arrive at irregular times, and the no-wait constraint allows the changes in the job order to flexibly manage such irregularity. The flexible flow shop scheduling problems with no-wait have mainly addressed for flow optimization on the shop floor in manufacturing, processing, and allied industries. The scope of this paper is to identify the literature available on permutation and non-permutation flow shop scheduling with no-wait constraint. This paper organizes scheduling problems based on performance measures of variability and shop environments. The extended summary of two/three-machine and m-machine problems has been compiled, including their objectives, algorithms, parametric considerations, and their findings. A systematic appearance of both conceptual and analytical results summarizes various advances of the no-wait constraint. The paper includes independently investigated problems and suggestions for future research directions.
Keywords: Flexible scheduling, flow shop, non-permutation, no-wait and permutation
@article{RO_2021__55_1_27_0,
author = {Singh, Harpreet and Oberoi, Jaspreet Singh and Singh, Doordarshi},
title = {Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review},
journal = {RAIRO. Operations Research},
pages = {27--50},
year = {2021},
publisher = {EDP-Sciences},
volume = {55},
number = {1},
doi = {10.1051/ro/2020055},
mrnumber = {4223876},
language = {en},
url = {https://www.numdam.org/articles/10.1051/ro/2020055/}
}
TY - JOUR AU - Singh, Harpreet AU - Oberoi, Jaspreet Singh AU - Singh, Doordarshi TI - Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review JO - RAIRO. Operations Research PY - 2021 SP - 27 EP - 50 VL - 55 IS - 1 PB - EDP-Sciences UR - https://www.numdam.org/articles/10.1051/ro/2020055/ DO - 10.1051/ro/2020055 LA - en ID - RO_2021__55_1_27_0 ER -
%0 Journal Article %A Singh, Harpreet %A Oberoi, Jaspreet Singh %A Singh, Doordarshi %T Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review %J RAIRO. Operations Research %D 2021 %P 27-50 %V 55 %N 1 %I EDP-Sciences %U https://www.numdam.org/articles/10.1051/ro/2020055/ %R 10.1051/ro/2020055 %G en %F RO_2021__55_1_27_0
Singh, Harpreet; Oberoi, Jaspreet Singh; Singh, Doordarshi. Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review. RAIRO. Operations Research, Tome 55 (2021) no. 1, pp. 27-50. doi: 10.1051/ro/2020055
, and , Energy cost minimization for unrelated parallel machine scheduling under real time and demand charge pricing. J. Clean. Prod. 208 (2019) 232–242. | DOI
and , A novel hybrid genetic algorithm for the open shop scheduling problem. Int. J. Adv. Manuf. Technol. 62 (2012) 775–787. | DOI
, and , Decision support system for the selection of advanced manufacturing technologies. J. Eng. Res. 4 (2016) 130–150.
, and , An immune algorithm approach to the scheduling of a flexible PCB flow shop. Int. J. Adv. Manuf. Technol. 22 (2003) 819–827. | DOI
and , No-wait flowshops with bicriteria of makespan and total completion time. J. Oper. Res. Soc. 53 (2002) 1004–1015. | Zbl | DOI
, and , No-wait flowshop scheduling problem with two criteria; total tardiness and makespan. Eur. J. Oper. Res. 269 (2018) 590–601. | MR | DOI
, and , No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan. Appl. Math. Comput. 365 (2020) 124688. | MR
and , Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Comput. Ind. Eng. 47 (2004) 431–450. | DOI
, A branch-and-bound algorithm for flow shop scheduling problems. J. AIIE Trans. 2 (1970) 172–176. | DOI
, and , A genetic algorithm for the simultaneous lot sizing and scheduling problem in capacitated flow shop with complex setups and backlogging. Int. J. Adv. Manuf. Technol. 70 (2014) 125–134. | DOI
, , , and , Permutation flow shop scheduling problem to minimize nonlinear objective function with release dates. Comput. Ind. Eng. 112 (2017) 336–347. | DOI
, , and , Flow shop learning effect scheduling problem with release dates. Omega 78 (2018) 21–38. | DOI
, Scheduling and worker assignment problems on hybrid flowshop with cost-related objective function, Int. J. Adv. Manuf. Technol. 74 (2014) 267–283. | DOI
, , and , The migrating birds optimization metaheuristic for the permutation flow shop with sequence-dependent setup times. IFAC-PapersOnLine 49 (2016) 408–413. | DOI
, , and , An immunity-based hybrid genetic algorithms for permutation flowshop scheduling problems. Int. J. Adv. Manuf. Technol. 85 (2016) 2459–2469. | DOI
, and , Production scheduling optimization in foundry using hybrid particle swarm optimization algorithm. Proc. Manuf. 22 (2017) 57–64.
and , Decomposition methods for cost and tardiness reduction in aircraft manufacturing flow lines. Comput. Oper. Res. 103 (2019) 134–147. | MR | DOI
, and , Parallel metaheuristics for the cyclic flow shop scheduling problem. Comput. Ind. Eng. 95 (2016) 156–163. | DOI
, and , Flowshop scheduling of construction processes with uncertain parameters. Arch. Civil Mech. Eng. 19 (2019) 194–204. | DOI
and , Some applications of the branch-and-bound algorithm to the machine scheduling problem. Oper. Res. Soc. 17 (1966) 173–186. | DOI
, and , Synchronous flow shop scheduling with pliable jobs. Eur. J. Oper. Res. 270 (2018) 943–956. | MR | DOI
, and , A heuristic algorithm for the Job, machine sequencing problem. Manage. Sci. 16 (1970) 630–637. | Zbl | DOI
, , and , Minimizing makespan in mixed no-wait flowshops with sequence-dependent setup times. Comput. Ind. Eng. 130 (2019) 338–347. | DOI
and , A two-level method of production planning and scheduling for bi-objective reentrant hybrid flow shop. Comput. Ind. Eng. 106 (2017) 174–181. | DOI
, and , Theory of Scheduling. Addison-Wesley Publishing, Reading, MA (1967). | MR | Zbl
, and , Minimizing total completion time in the two-machine no-idle no-wait flow shop problem. J. Heuristics (2019) 1–15. DOI: . | DOI
and , A tabu-search heuristic for the flexible-resource flow shop scheduling problem. Ann. Oper. Res. 41 (1993) 207–230. | Zbl | DOI
and , A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion. Comput. Oper. Res. 39 (2012) 2152–2160. | MR | Zbl | DOI
and , A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem. Swarm Evol. Comput. 32 (2017) 121–131. | DOI
, and , Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic. Ann. Oper. Res. 267 (2018) 101–134. | MR | DOI
, and , Carbon-efficient scheduling of flow shops by multi-objective optimization. Eur. J. Oper. Res. 248 (2016) 758–771. | MR | DOI
, and , Efficient heuristics for the hybrid flow shop scheduling problem with missing operations. Comput. Ind. Eng. 115 (2018) 88–99. | DOI
and , Strategic Management of Sustainable Manufacturing Operation. IGI Global, Hersheys, PE (2016). | DOI
, Maximin programming, fuzzy linear programming and multi-criteria decision making. J. Oper. Res. Soc. 31 (1980) 263–267. | Zbl | DOI
, and , Hybrid flow shop scheduling with sequence-dependent family setup time and uncertain due dates. Appl. Math. Model. 38 (2013) 2490–2504. | MR | DOI
and , A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems. Appl. Soft Comput. 72 (2018) 166–176. | DOI
, and , Project schedule with alternative activities and relationships. J. Eng. Res. 5 (2017) 30–49.
, and , A mathematical model and extension algorithm for assembly flexible flow shop scheduling problem. Int. J. Adv. Manuf. Technol. 65 (2013) 787–802. | DOI
, , and , A BRILS metaheuristic for non-smooth flow-shop problems with failure-risk costs. Expert Syst. App. 44 (2016) 177–186. | DOI
, and , A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem. Eur. J. Oper. Res. 275 (2019) 139–154. | MR | DOI
, , , and , Two-agent stochastic flow shop deteriorating scheduling via a hybrid multi-objective evolutionary algorithm. J. Intell. Manuf. 30 (2018) 2257–2272. | DOI
, and , Flexible flow shop with storage: complexity and optimisation methods. IFAC-PapersOnLine 49 (2016) 237–242. | DOI
, , and , A hybrid approach for minimizing makespan in permutation flowshop scheduling. J. Syst. Sci. Syst. Eng. 26 (2017) 50–76. | DOI
and , New block properties for the permutation flow shop problem with application in tabu search. J. Oper. Res. Soc. 52 (2001) 210–220. | Zbl | DOI
, and , On flow shop scheduling with release and due dates to minimize maximum lateness. J. Oper. Res. Soc. 34 (1983) 615–620. | MR | Zbl | DOI
, , and , Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Disc. Math. 5 (1979) 287–326. | MR | Zbl | DOI
, and , Flexible manufacturing systems: an investigation for research and applications. Eur. J. Oper. Res. 66 (1993) 1–26. | DOI
, Flowshop schedules with sequence dependent setup times. J. Oper. Res. 29 (1986) 206–219. | MR | Zbl
and , Two-machine flowshop scheduling to minimize the number of tardy jobs. J. Oper. Res. Soc. 48 (1997) 212–220. | Zbl | DOI
and , An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal. Ann. Oper. Res. 50 (1994) 263–279. | MR | Zbl | DOI
, , and , Evolutionary multi-objective blocking lot-streaming flow shop scheduling with interval processing time. Appl. Soft Comput. 42 (2016) 229–245. | DOI
and , Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations. Ann. Oper. Res. 83 (1998) 95–114. | MR | Zbl | DOI
, Optimal two and three stage production schedules with setup times included. Nav. Res. Logist. 1 (1953) 61–68. | DOI
, and , Games, critical paths and assignment problems in permutation flow shops and cyclic scheduling flow line environments. J. Oper. Res. Soc. 43 (1992) 241–258. | Zbl | DOI
and , Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption. Comput. Oper. Res. 79 (2017) 94–108. | MR | DOI
, and , New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times. J. Ind. Eng. Int. 13 (2017) 297–306. | DOI
and , Three-machine flow shop scheduling with overlapping waiting time constraints. Comput. Oper. Res. 101 (2019) 93–102. | MR | DOI
, and , Priority scheduling to minimize the total tardiness for remanufacturing systems with flow-shop-type reprocessing lines. Int. J. Adv. Manuf. Technol. 91 (2017) 3697–3708. | DOI
, , and , Improved discrete cuckoo optimization algorithm for the three-stage assembly flowshop scheduling problem. Comput. Ind. Eng. 105 (2017) 158–173. | DOI
, and , Robust scheduling of a two-machine flow shop with uncertain processing times. IIE Trans. 32 (2000) 421–432. | DOI
, Ant colony system with a novel non-daemonactions procedure for multiprocessor task scheduling in multistage hybrid flow shop. Swarm Evol. Comput. 44 (2019) 987–1002. | DOI
, and , Lot streaming in [N − 1](1) + N(m) hybrid flow shop. J. Manuf. Syst. 44 (2017) 12–21. | DOI
, and , Minimizing total tardiness on parallel machines subject to flexible maintenance. Int. J. Ind. Eng.: Theory App. Pract. 25 (2018) 472–489.
, and , Online scheduling of ordered flow shops. Eur. J. Oper. Res. 272 (2019) 50–60. | MR | DOI
and , Hybrid flow shop scheduling with assembly operations and key objectives: a novel neighborhood search. Appl. Soft Comput. 61 (2017) 122–128. | DOI
and , Shop floor lot-sizing and scheduling with a two-stage stochastic programming model considering uncertain demand and workforce efficiency. Comput. Ind. Eng. 111 (2017) 263–271. | DOI
, , , and , An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects. Inf. Sci. 453 (2018) 408–425. | MR | DOI
, Minimizing the number of machine idle intervals with minimum makespan in a flow-shop. J. Oper. Res. Soc. 44 (1993) 817–824. | Zbl | DOI
, and , An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem. Appl. Soft Comput. 12 (2012) 1755–1764. | DOI
and , Genetic algorithms: foundations and applications. Ann. Oper. Res. 21 (1989) 31–57. | Zbl | DOI
, Hybrid algorithm for sequencing with bicriteria. J. Optim. Theory App. 39 (1983) 105–124. | MR | Zbl | DOI
and , Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics. Omega 64 (2016) 115–125. | DOI
, and , A Backtracking search hyper-heuristic for the distributed assembly flow-shop scheduling problem. Swarm Evol. Comput. 36 (2017) 124–135. | DOI
and , Two-machine no-wait flowshop scheduling with learning effect and convex resource-dependent processing times. Comput. Ind. Eng. 75 (2014) 170–175. | DOI
, and , Scheduling permutation flow shops using the Lagrangian relaxation technique. Ann. Oper. Res. 70 (1997) 171–189. | MR | Zbl | DOI
, and , Minimizing energy consumption and tardiness penalty for fuzzy flow shop scheduling with state-dependent setup time. J. Clean. Prod. 147 (2017) 470–484. | DOI
, and , New meta-heuristic for dynamic scheduling in permutation flowshop with new order arrival. Int. J. Adv. Manuf. Technol. 98 (2018) 1817–1830. | DOI
, A branch-and-bound algorithm for the exact solution of the three-machine scheduling problem. J. Oper. Res. Soc. 16 (1965) 89–100. | DOI
, and , A robust simulated annealing heuristic for flow shop scheduling problems. Int. J. Adv. Manuf. Technol. 23 (2004) 762–767. | DOI
, and , Hybrid monkey search algorithm for flow shop scheduling problem under makespan and total flow time. Appl. Soft Comput. 55 (2017) 82–92. | DOI
, and , An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors – a case study. Comput. Oper. Res. 114 (2020) 104812. | MR | DOI
, , and , Multi-item capacitated lot-sizing problem in a flow-shop system with energy consideration. IFAC Papers Proc. 49 (2016) 301–306.
and , Flow-shop scheduling with the branch-and-bound method. Oper. Res. 15 (1967) 373–589.
and , A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times. IIE Trans. 31 (1999) 721–731. | DOI
and , An enhanced TSP-based heuristic for makespan minimization in a flow shop with a setup times. J. Heuristics 5 (1999) 53–70. | Zbl | DOI
, and , A review and evaluation of multiobjective algorithms for the flowshop scheduling problem. Informs J. Comput. 20 (2008) 451–471. | MR | Zbl | DOI
, and , Elimination conditions and lower bounds for the permutation flow shop scheduling problem. Acta Math. Appl. Sin. 2 (1985) 321–331. | Zbl | DOI
, A novel hybrid genetic algorithm to solve the sequence-dependent permutation flow-shop scheduling problem. Int. J. Adv. Manuf. Technol. 71 (2014) 429–437. | DOI
and , A TLBO and a Jaya heuristics for permutation flow shop scheduling to minimize the sum of inventory holding and batch delay costs. Comput. Ind. Eng. 124 (2018) 509–522. | DOI
, and , Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependence-sequence setup times and makespan minimization. Comput. Ind. Eng. 135 (2019) 79–104. | DOI
, and , Alternative constructive heuristic algorithm for permutation flow shop scheduling problem with makespan criterion. Int. J. Ind. Eng.: Theory App. Pract. 19 (2012) 289–296.
, Strategic flexibility for competitiveness. Global J. Flexible Syst. Manage. 3 (2002) III.
, and , Hybrid flow shop scheduling problems involving setup considerations: a literature review and analysis. Int. J. Ind. Eng.: Theory App. Pract. 20 (2013) 614–630.
, and , Bi-objective hybrid flow shop scheduling: a new local search. Int. J. Adv. Manuf. Technol. 64 (2013) 933–950. | DOI
and , A high-quality solution constructive heuristic for flow shop sequencing. J. Oper. Res. Soc. 53 (2002) 1374–1379. | Zbl | DOI
, and , An evolutionary clustering search for the no-wait flow shop problem with sequence dependent setup times. Expert Syst. App. 41 (2014) 3628–2633. | DOI
, and , A new efficient heuristic method for minimizing the total tardiness in a no-idle permutation flow shop. Prod. Eng. 11 (2017) 523–529. | DOI
, and , A branch-and-bound approach for a two-machine flowshop scheduling problem. J. Oper. Res. Soc. 46 (1995) 721–734. | Zbl | DOI
, and , A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem. Ann. Oper. Res. 63 (1996) 397–414. | Zbl | DOI
, , and , 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 (2014) 52–65. | MR | Zbl | DOI
, , and , Effective iterated greedy algorithm for flow-shop scheduling problems with time lags. Chin. J. Mech. Eng. 30 (2017) 652–662. | DOI
and , Evolutionary multi-objective optimization for the multi-machine flow shop scheduling problem under blocking. Ann. Oper. Res. 267 (2017) 413–430. | MR | DOI
and , Optimization and constraint based heuristic methods for advanced planning and scheduling systems. Int. J. Ind. Eng.: Theory App. Pract. 23 (2016) 26–48.
, Sequencing jobs through a multi-stage process in the minimum total time – a quick method of obtaining a near optimum. J. Oper. Res. Soc. 16 (1965) 101–107. | DOI
and , No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm. Int. J. Adv. Manuf. Technol. 39 (2008) 796–807. | DOI
, , and , A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem. Expert Syst. App. 38 (2011) 3252–3259. | DOI
, and , A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers. Appl. Soft Comput. 11 (2011) 5270–5280. | DOI
, , , and , Effective heuristics and meta-heuristics to minimize total flowtime for the distributed permutation flowshop problem. Expert Syst. App. 124 (2019) 309–324. | DOI
, Scheduling of a two-machine flowshop with travel time between machines. J. Oper. Res. Soc. 42 (1991) 609–613. | Zbl | DOI
and , Ordered flow shop problems with no in-process waiting. J. Oper. Res. Soc. 31 (1980) 1039–1043. | MR | Zbl | DOI
and , Heuristics for a flowshop scheduling problem with stepwise job objective function. Eur. J. Oper. Res. 266 (2018) 950–962. | MR | DOI
, Scheduling: Theory, Algorithms, and Systems. 3rd edition, edited by . Springer, New York, NY (2008). | MR | Zbl
, Scheduling: Theory, Algorithms, and Systems. 4th edition, edited by . Springer, New York, NY (2012). | MR | Zbl
, An adaptive branching rule for the permutation flow-shop problem. Eur. J. Oper. Res. 5 (1980) 19–25. | MR | Zbl | DOI
and , A genetic algorithm applied heuristic to minimize the makespan in a flow shop. Proc. Eng. 97 (2014) 1735–1744. | DOI
, , and , Generating non-permutation schedules in flowline-based manufacturing systems with sequence-dependent setup times of jobs: a heuristic approach. Int. J. Adv. Manuf. Technol. 23 (2004) 64–78. | DOI
, , , , and , An effective hybrid discrete grey wolf optimizer for the casting production scheduling problem with multi-objective and multi-constraint. Comput. Ind. Eng. 128 (2019) 458–476. | DOI
, Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling, edited by , In Vol 236 of International Series in Operation Research and Management Science, Springer, New York, NY (2016) 127–140. | MR
, A no-wait flow shop scheduling heuristic to minimize makespan. J. Oper. Res. Soc. 45 (1994) 472–478. | Zbl | DOI
, and , Toward an integrated modeling approach for production and delivery operations in flow shop system: trade-off between direct and routing delivery methods. J. Manuf. Syst. 44 (2017) 79–92. | DOI
and , On the flow-shop scheduling problem with no-wait in process. J. Oper. Res. Soc. 23 (1972) 323–331. | Zbl | DOI
and , A new hybrid ant colony algorithm for scheduling of no-wait flowshop. Oper. Res. 18 (2016) 55–74.
, and , Efficient heuristics for the parallel blocking flow shop scheduling problem. Expert Syst. App. 74 (2017) 41–54. | DOI
, and , An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem. Expert Syst. App. 121 (2019) 347–361. | DOI
, and , Flow shop scheduling with multiple operations and time lags. J. Intell. Manuf. 6 (1995) 105–115. | DOI
, Some new results in flow shop scheduling. Z. Oper. Res. 28 (1984) 1–16. | MR | Zbl
, , and , A genetic algorithm for energy-efficiency in job-shop scheduling. Int. J. Adv. Manuf. Technol. 85 (2016) 1303–1314. | DOI
and , An enumeration algorithm for the no-wait flow shop problem with due date constraints. IFAC-PapersOnLine 49 (2016) 1803–1808. | DOI
and , On the exact solution of the no-wait flow shop problem with due date constraints. Comput. Oper. Res. 81 (2017) 41–159. | MR | DOI
and , A heuristic for no-wait flow shop scheduling. Int. J. Adv. Manuf. Technol. 68 (2013) 1327–1338. | DOI
and , Hybrid flow shop batching and scheduling with a bi-criteria objective. Int. J. Prod. Econ. 179 (2016) 239–258. | DOI
and , A comparison of two stage-based hybrid algorithms for a batch scheduling problem in hybrid flow shop with learning effect. Int. J. Prod. Econ. 195 (2018) 227–248. | DOI
and , A self-guided differential evolution with neighborhood search for permutation flow shop scheduling. Expert Syst. App. 51 (2016) 161–176. | DOI
, and , A hybrid discrete optimization algorithm based on teaching–probabilistic learning mechanism for no-wait flow shop scheduling. Knowl. Based Syst. 107 (2016) 219–234. | DOI
, and , An extended teaching-learning based optimization algorithm for solving no-wait flow shop scheduling problem. Appl. Soft Comput. 61 (2017) 193–210. | DOI
, and , Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion. Appl. Soft Comput. 54 (2017) 164–182. | DOI
, and , Self-adaptive discrete invasive weed optimization for the blocking flow-shop scheduling problem to minimize total tardiness. Comput. Ind. Eng. 111 (2017) 331–351. | DOI
, , and , An efficient discrete invasive weed optimization for blocking flow-shop scheduling problem. Eng. App. Artif. Intell. 78 (2019) 124–141. | DOI
, and , A novel multi-objective discrete water wave optimization for solving multi-objective blocking flow-shop scheduling problem. Knowl. Based Syst. 165 (2019) 110–131. | DOI
and , Issues in managing manufacturing flexibility. Global J. Flexible Syst. Manage. 3 (2002) 11–29.
, , and , Multi-objective open shop scheduling by considering human error and preventive maintenance. Appl. Math. Model. 67 (2019) 573–587. | MR | DOI
and , Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times. Eur. J. Oper. Res. 264 (2018) 66–73. | MR | DOI
, and , Decision-making approaches and heuristics algorithms for multi-objective flow shop scheduling. Int. J. Res. Eng. App. Manage. 5 (2019) 60–66.
, and , Optimizing a multi-objective flow shop scheduling problem by meta-heuristic approach. Int. J. Res. Eng. App. Manage. 5 (2019) 20–26.
and , A general algorithm for solution of the -job, -machine sequencing problem of the flow shop. Oper. Res. 15 (1967) 71–82. | Zbl | DOI
, A two-machine permutation flow shop scheduling problem with buffers. OR Spectr. 20 (1998) 229–235. | MR | Zbl | DOI
, and , Heuristics for permutation flow shop scheduling with batch setup times. OR Spectr. 18 (1996) 67–80. | Zbl | DOI
and , On non-permutation solutions to some two machine flow shop scheduling problems. Z. Oper. Res. 39 (1994) 305–319. | MR | Zbl
and , Hybrid genetic algorithm and tabu search for finite capacity material requirement planning system in flexible flow shop with assembly operations. Comput. Ind. Eng. 97 (2016) 157–169. | DOI
, The clustered flow-shop problem. J. Oper. Res. 32 (1988) 315–322. | MR | Zbl
and , An approximate solution of the flow-shop problem with sequence dependent setup times. J. Oper. Res. 33 (1989) 439–451. | MR | Zbl
and , A two-criteria objective function flexible flow shop scheduling problem with machine eligibility constraint. Int. J. Adv. Manuf. Technol. 64 (2013) 1001–1015. | DOI
, and , Flowshop sequencing with non-permutation schedules. Comput. Chem. Eng. 15 (1991) 601–607. | DOI
and , Solving machine loading problems in a flexible manufacturing system using a genetic algorithm based heuristic approach. Int. J. Prod. Res. 38 (2000) 3357–3384. | Zbl | DOI
and , Multicriteria Scheduling: Theory, Models and Algorithms, 2nd edition, edited by and . Springer-Verlag, Berlin-Heidelberg (2005). | Zbl
, , and , An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. Eur. J. Oper. Res. 142 (2002) 250–257. | MR | Zbl | DOI
, and , Modelling and scheduling multi-objective flow shop problems with interfering jobs. Appl. Soft Comput. 54 (2017) 221–228. | DOI
, A branch-and-bound approach to schedule a no-wait flow shop to minimize the CVaR of the residual work content. Comput. Ind. Eng. 129 (2019) 67–75. | DOI
and , Solvable cases of the no-wait flow shop scheduling problem. J. Oper. Res. Soc. 22 (1991) 971–980. | Zbl | DOI
and , A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem. Comput. Oper. Res. 40 (2013) 1064–1075. | MR | DOI
, , and , An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem. Int. J. Prod. Econ. 145 (2013) 387–396. | DOI
, , , and , Several flow shop scheduling problems with truncated position-based learning effect. Comput. Oper. Res. 40 (2013) 2906–2929. | MR | DOI
and , Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search. Omega 94 (2019) 102117. | DOI
, , and , Non-permutation flow shop scheduling with order acceptance and weighted tardiness. Appl. Math. Comput. 270 (2015) 312–333. | MR
and , A multi-objective ant colony system algorithm for flow shop scheduling problem. Expert Syst. App. 37 (2010) 1361–1368. | DOI
, , , and , A multi-level optimization approach for energy-efficient flexible flowshop scheduling. J. Clean. Prod. 137 (2016) 1543–1552. | DOI
and , A three-machine permutation flow-shop problem with minimum makespan on the second machine. J. Oper. Res. Soc. 57 (2006) 460–468. | Zbl | DOI
, and , An improved heuristic for no-wait flow shop to minimize makespan. J. Manuf. Syst. 44 (2017) 273–279. | DOI
, Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic. Int. J. Adv. Manuf. Technol. 38 (2008) 348–354. | DOI
and , Multi-heuristic desirability ant colony system heuristic for non-permutation flowshop scheduling problems. Int. J. Adv. Manuf. Technol. 33 (2007) 793–802. | DOI
and , Minimizing makespan for no-wait flowshop scheduling problems with setup times. Comput. Ind. Eng. 121 (2018) 73–81. | DOI
, and , Sequencing of an M machine flow shop with setup, processing and removal times separated. Int. J. Adv. Manuf. Technol. 30 (2006) 286–296. | DOI
and , Minimizing tardiness and maintenance costs in flow shop scheduling by a lower-bound-based GA. Comput. Ind. Eng. 97 (2016) 26–40. | DOI
, and , A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility. Comput. Oper. Res. 100 (2018) 211–229. | MR | DOI
, , and , Dynamic scheduling of a flow shop with on-site wind generation for energy cost reduction under real-time electricity pricing. CIRP Ann. Manuf. Technol. 66 (2017) 41–44. | DOI
, , , and , A hybrid harmony search algorithm with efficient job sequence scheme and variable neighborhood search for the permutation flow shop scheduling problems. Eng. App. Artif. Intell. 65 (2017) 178–199. | DOI
, , , and , A discrete water wave optimization algorithm for no-wait flow shop scheduling problems. Expert Syst. App. 91 (2018) 347–363. | DOI
, , , , , and , An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem. J. Eng. Optim. 51 (2018) 1727–1742. | MR | DOI
, , , , and , A factorial based particle swarm optimization with a population adaptation mechanism for the no-wait flow shop scheduling problem with the makespan objective. Expert Syst. App. 126 (2019) 41–53. | DOI
, , , , and , A hybrid biogeography-based optimization with variable neighborhood search mechanism for no-wait flow shop scheduling problem. Expert Syst. App. 126 (2019) 321–339. | DOI
, , and , Bat algorithm for flexible flow shop scheduling with variable processing time. In: Vol. 690 of Part of the Advances in Intelligent Systems and Computing Book Series. In ICMIR’ 17: Proceedings of International Conference on Mechatronics and Intelligent Robotics. (AISC) 1 (2017) 164–171. https://link.springer.com/conference/icmir.
, and , Solving a new mathematical model for a hybrid flow shop scheduling problem with a processor assignment by a genetic algorithm. Int. J. Adv. Manuf. Technol. 61 (2012) 339–349. | DOI
, and , Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Comput. Oper. Res. 36 (2009) 1249–1267. | MR | Zbl | DOI
, , and , Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems. Comput. Oper. Res. 104 (2019) 127–138. | MR | DOI
Cité par Sources :
