Location of Repository

Hybrid flowshop scheduling with dual resources in a supply chain



Graduation date: 2013This dissertation addresses a hybrid-flow shop scheduling problem with dual resource constraints in a supply chain. Most of the traditional scheduling problems deal with machine as the only resource. However, other resources such as labor is not only required for processing jobs but are often constrained. Considering the second resource (labor) makes the scheduling problems more realistic and practical to implement in industries. In this research labor has different skill levels and the skill level required to perform the setup could be different from that needed to perform the run. The setup time is sequence-dependent, and job release times and machine availability times are dynamic. Also machine skipping is allowed. In tactical supply chain decisions such as scheduling, the goal is to minimize the cost of producer. However, when looking at the whole network, minimizing the cost of the producer alone may not lead to minimizing the cost of the whole supply chain. In fact the coordination between the producer and other entities in the network can minimize the cost. In this dissertation coordination between producer and customers is considered in order to make effective scheduling decisions. The goal of this research is to minimize the work-in-process inventory for the producer and maximize customers' service level to maintain producer-customers coordination. A linear mixed-integer mathematical programming model is proposed and CPLEX solver is used to find solutions for generated example problems with branch-and-bound technique. As the problem is NP-hard in the strong sense three different meta-search heuristic algorithms based on tabu search are developed in order to quickly solve the scheduling problems. A total of 243 examples were generated in small, medium and large size problems. Search algorithms performance in small size problems can be assessed by comparing them with the optimal solution from branch-and-bound method. However, in medium and large size problems, branch-and-bound method cannot find the optimal solution and therefore for assessing the performance of search algorithms three different lower bounding methods are proposed. The first method is based on Logic-Based Benders Decomposition and the second and third methods are two different variations of iterative selective linear programming (LP) relaxation called fractional LP relaxation and positive LP relaxation. An experimental analysis based on a nested-factorial design with blocking is developed in order to identify statistically significant differences between the effectiveness and efficiency of the lower bounding methods and search algorithms. The results showed that the proposed search algorithms and lower bounding methods are very effective and efficient. On average the developed lower bounding methods tighten the lower bound found by branch-and-bound by 11.93%. The quality of search algorithms is the same as the upper bound found by branch-and-bound. However, the search algorithms are on average 3.8 times faster than the branch-and-bound method

Topics: Scheduling, Mixed integer Programming, Hybrid flowshop, Dual resources, Tabu search, Logic based benders decomposition, supply chain
Year: 2013
OAI identifier: oai:ir.library.oregonstate.edu:1957/38553
Provided by: ScholarsArchive@OSU

Suggested articles



  1. (2006). A bicriteria scheduling with sequence-dependent setup times.
  2. (2004). A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness.
  3. (2000). A branch-and-bound algorithm for the hybrid flowshop.
  4. (2005). A comprehensive review and evaluation of permutation flowshop heuristics.
  5. (1999). A Genetic Algorithm Based Approach for Scheduling of Dual-Resource Constrainded Manufacturing Systems.
  6. (2004). A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation.
  7. (2006). A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility.
  8. (2005). A hybrid algorithm for a class of resource constrained scheduling problems.
  9. (2004). A hybrid method for planning and scheduling.
  10. (1998). A hybrid three-stage flowshop problem: efficient heuristics to minimize makespan.
  11. (1977). A methodology for assigning minimum cost due-dates.
  12. (1986). A MILP model for the n-job, m-stage flowshop with sequence dependent set-up times.
  13. (2006). A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times.
  14. (2006). A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time.
  15. (2008). A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks.
  16. (1970). A simulation of labor efficiency and centralized assignment in a production model.
  17. (1979). A simulation study of predictable due-dates.
  18. (2004). A tabu search algorithm for parallel machine total tardiness problem.
  19. (2009). A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers.
  20. (2008). A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines.Computers
  21. (2001). Algorithms for hybrid MILP/CP models for a class of optimization problems.
  22. (2013). Allocating job-shop manpower to minimize Lmax: Optimality criteria, search heuristics, and probabilistic quality metrics.
  23. (2013). An effective lower bound on Lmax in a worker-constrained job shop.
  24. (2006). An immune algorithm approach to hybrid flow shops scheduling with sequencedependent setup times.
  25. (2004). An introduction to multiobjective metaheuristics for scheduling and timetabling.
  26. (1985). An investigation of labor assignment rules in a dual-constrained job shop.
  27. (2008). An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks.
  28. (1995). An overview of tabu search approaches to production scheduling problems,
  29. (1990). Approximation algorithms for scheduling unrelated parallel machines.
  30. (2009). Bicriteria scheduling of a two-machine flowshop with sequence-dependent setup times.
  31. (1996). Bicriteria scheduling problem for unrelated parallel machines.
  32. (2011). Bicriteria supply chain scheduling on unrelated-parallel machines.
  33. (1991). Branch and bound algorithm for the flow shop with multiple processors.
  34. (1998). Branch and bound crossed with GA to solve hybrid flowshops.
  35. (1979). Computers and intractability: A guide to the theory of NP-completeness,
  36. (2009). Design and analysis of experiments. 7th ed.
  37. (2009). Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints.
  38. (1999). Dry kiln scheduling in furniture production.
  39. (1981). Dual response parallel queues with server transfer and information access delays.
  40. (2008). Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times.
  41. (2006). Flow shop scheduling problem with limited machine availability: a heuristic approach.
  42. (1972). Generalized benders decomposition.
  43. (1999). Genetic algorithm for minimizing tardiness in flow-shop scheduling.
  44. (1996). Genetic algorithms for flowshop scheduling problems.
  45. (1997). Heuristic algorithms for the two-stage hybrid flowshop problem.
  46. (1999). Hybrid flow shop scheduling: a survey.
  47. (2009). Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers.
  48. (2005). Integrated scheduling of production and distribution operations.
  49. (1999). Integrating genetic algorithms, tabu search, and simulated annealing for the unit commitment problem. Power Systems,
  50. (2010). Iterated greedy local search methods for unrelated parallel machine scheduling.
  51. (1966). Labor assignment as a dynamic control problem.
  52. (2010). Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness.
  53. (1995). Logic circuit verification by Benders decomposition.
  54. (2000). Logic-based Benders decomposition.
  55. (2000). Logic-based Methods for Optimization: Combining Optimization and Constraint Satisfaction.
  56. (2005). Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach.
  57. (2007). Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches.
  58. (2006). Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem.
  59. (2007). Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion. International journal of production economics,
  60. (2008). Minimising total tardiness in the mmachine flowshop problem: A review and evaluation of heuristics and metaheuristics.
  61. (1998). Minimizing tardy jobs in a two-stage hybrid flowshop.
  62. (2009). Minimizing total tardiness for the machine scheduling and worker assignment problems in identical parallel machines using genetic algorithms.
  63. (2005). Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop.
  64. (1990). Minimizing total tardiness on one machine is NP-hard.
  65. (2006). Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach.
  66. (2012). Non-permutation flowshop scheduling in a supply chain with sequence-dependent setup times.
  67. (2013). Non-permutation flowshop scheduling with dual resources. Expert Systems with Applications.
  68. (2008). On the hybrid flowshop scheduling problem.
  69. (1973). Operating policies in multiechelon dual-constraint job shops.
  70. (1954). Optimal two‐and three‐stage production schedules with setup times included. Naval research logistics quarterly,
  71. (1995). Parallel search for combinatorial optimization: genetic algorithms, simulated annealing, tabu search and GRASP.
  72. (1962). Partitioning procedures for solving mixed-variables programming problems.
  73. (2007). Planning and scheduling by logic-based Benders decomposition.
  74. (2005). Planning and scheduling to minimize tardiness.
  75. (1997). Production control in hybrid flowshops: an example from textile manufacturing. In:
  76. (1965). Queuing with alternating priorities.
  77. (2011). Recent developments in Dual Resource Constrained (DRC) system research.
  78. (2010). Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective.
  79. (2009). Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness.
  80. (2007). Scheduling in supply chain environment.
  81. (1999). Scheduling jobs on unrelated parallel machines to minimize regular total cost functions.
  82. (2000). Scheduling of manufacturing systems under dual-resource constraints using genetic algorithms.
  83. (1996). Scheduling research in multiple resource constrained job shops: a review and critique.
  84. (2006). Scheduling two-stage hybrid flow shop with availability constraints.
  85. (2007). Scheduling unrelated parallel machines with sequence-dependent setups.
  86. (2008). Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic.
  87. (2010). STATGRAPHICS Centurion XVI: Version 16.1.02. APPENDICES APPENDIX A. Comparison between Tabu Search, Genetic Algorithm and Hybrid of Tabu Search-Genetic Algorithm
  88. (2007). Supply chain scheduling: Conflict and cooperation in assembly systems.
  89. (2010). Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness.
  90. (1999). Tabu search for total tardiness minimization in flowshop scheduling problems.
  91. (1989). Tabu search—part I.
  92. (1990). Tabu search—part II.
  93. (1990). Tabu search: A tutorial.
  94. (2002). Tabu Search. Manuel Laguna. 6th edition,
  95. (1976). The complexity of flowshop and jobshop scheduling.
  96. (1968). Two queues attended by a single server.
  97. (1999). Two-machine flowshop scheduling with bicriteria problem.
  98. (2004). Unrelated parallel machine scheduling with job splitting.
  99. (2007). Using ant colony optimization to solve hybrid flow shop scheduling problems. The international journal of advanced manufacturing technology,
  100. (2003). Using genetic algorithms for singlemachine bicriteria scheduling problems.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.