Scheduling strategies for the furniture industry

Technological developments and more demanding production standards have constantly been pushing the envelope, changing the perception of what is possible and desired in manufacturing processes. Such improvements are often made at marginal cost, yet have the potential to significantly benefit performance, enabling a strong competitive advantage. In this case study, a factory in the furniture industry is considered, where there are vast improvement opportunities and an increase in flexibility is needed. Furthermore, this problem can be best approximated by the flow shop model and the most critical characteristic is sequence-dependent setup times. To address this problem, an iterated greedy with local search meta-heuristic is implemented, which will be responsible for scheduling production orders in the way that best suits makespan and, consequently, productivity. Additionally, OptQuest, the optimiser functionally built into the Flexsim simulating software was also tested against the meta-heuristic and, still through simulation, a local rule was implemented, which allowed each workstation to define its own sequence of jobs, to minimise setup times. Lastly, the best performing of the previous methods was also compared to the original heuristic that had previously been specifically created for this problem. Through testing, it was found that the iterated greedy with local search meta-heuristic was able to generate solutions that had a much better makespan value than the ones produced by OptQuest, while the local rule was not able to provide significant improvement. Then, the meta-heuristic was compared to the original heuristic and, although the newly implemented algorithm did not consider all characteristics of the problem, productivity far outperformed that of the original technique

Utilizing Constraint Optimization for Industrial Machine Workload Balancing

Efficient production scheduling is an important application area of constraint-based optimization techniques. Problem domains like flow- and job-shop scheduling have been extensive study targets, and solving approaches range from complete and local search to machine learning methods. In this paper, we devise and compare constraint-based optimization techniques for scheduling specialized manufacturing processes in the build-to-print business. The goal is to allocate production equipment such that customer orders are completed in time as good as possible, while respecting machine capacities and minimizing extra shifts required to resolve bottlenecks. To this end, we furnish several approaches for scheduling pending production tasks to one or more workdays for performing them. First, we propose a greedy custom algorithm that allows for quickly screening the effects of altering resource demands and availabilities. Moreover, we take advantage of such greedy solutions to parameterize and warm-start the optimization performed by integer linear programming (ILP) and constraint programming (CP) solvers on corresponding problem formulations. Our empirical evaluation is based on production data by Kostwein Holding GmbH, a worldwide supplier in the build-to-print business, and thus demonstrates the industrial applicability of our scheduling methods. We also present a user-friendly web interface for feeding the underlying solvers with customer order and equipment data, graphically displaying computed schedules, and facilitating the investigation of changed resource demands and availabilities, e.g., due to updating orders or including extra shifts

Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey

Wireless sensor networks (WSNs) consist of autonomous and resource-limited devices. The devices cooperate to monitor one or more physical phenomena within an area of interest. WSNs operate as stochastic systems because of randomness in the monitored environments. For long service time and low maintenance cost, WSNs require adaptive and robust methods to address data exchange, topology formulation, resource and power optimization, sensing coverage and object detection, and security challenges. In these problems, sensor nodes are to make optimized decisions from a set of accessible strategies to achieve design goals. This survey reviews numerous applications of the Markov decision process (MDP) framework, a powerful decision-making tool to develop adaptive algorithms and protocols for WSNs. Furthermore, various solution methods are discussed and compared to serve as a guide for using MDPs in WSNs