Search results for: permutation flow shop problem

Authors: Aydin Teymourifar, Gurkan Ozturk

Abstract:

In this paper, a hybrid distributed algorithm has been suggested for the multi-objective job shop scheduling problem. Many new approaches are used at design steps of the distributed algorithm. Co-evolutionary structure of the algorithm and competition between different communicated hybrid algorithms, which are executed simultaneously, causes to efficient search. Using several machines for distributing the algorithms, at the iteration and solution levels, increases computational speed. The proposed algorithm is able to find the Pareto solutions of the big problems in shorter time than other algorithm in the literature. Apache Spark and Hadoop platforms have been used for the distribution of the algorithm. The suggested algorithm and implementations have been compared with results of the successful algorithms in the literature. Results prove the efficiency and high speed of the algorithm.

Keywords: distributed algorithms, Apache Spark, Hadoop, job shop scheduling, multi-objective optimization

Procedia PDF Downloads 333

Authors: Aydin Teymourifar, Gurkan Ozturk

Abstract:

In this paper, a hybrid distributed algorithm has been suggested for multi-objective dynamic flexible job shop scheduling problem. The proposed algorithm is high level, in which several algorithms search the space on different machines simultaneously also it is a hybrid algorithm that takes advantages of the artificial intelligence, evolutionary and optimization methods. Distribution is done at different levels and new approaches are used for design of the algorithm. Apache spark and Hadoop frameworks have been used for the distribution of the algorithm. The Pareto optimality approach is used for solving the multi-objective benchmarks. The suggested algorithm that is able to solve large-size problems in short times has been compared with the successful algorithms of the literature. The results prove high speed and efficiency of the algorithm.

Keywords: distributed algorithms, apache-spark, Hadoop, flexible dynamic job shop scheduling, multi-objective optimization

Procedia PDF Downloads 316

Authors: Meng-Hui Chen, Chen-Yu Kao, Chia-Yu Hsu, Pei-Chann Chang

Abstract:

The main idea in this paper is using sequential pattern mining to find the information which is helpful for finding high performance solutions. By combining this information, it is defined as blocks. Using the blocks to generate artificial chromosomes (ACs) could improve the structure of solutions. Estimation of Distribution Algorithms (EDAs) is adapted to solve the combinatorial problems. Nevertheless many of these approaches are advantageous for this application, but only some of them are used to enhance the efficiency of application. Generating ACs uses patterns and EDAs could increase the diversity. According to the experimental result, the algorithm which we proposed has a better performance to solve the permutation flow-shop problems.

Keywords: combinatorial problems, sequential pattern mining, estimationof distribution algorithms, artificial chromosomes

Procedia PDF Downloads 570

Authors: Salah Al-Din I. Badran, Samad Ahmadi, Dylan Menzies, Ismail Shahin

Abstract:

This paper describes a new efficient blind source separation method; in this method we use a non-uniform filter bank and a new structure with different sub-bands. This method provides a reduced permutation and increased convergence speed comparing to the full-band algorithm. Recently, some structures have been suggested to deal with two problems: reducing permutation and increasing the speed of convergence of the adaptive algorithm for correlated input signals. The permutation problem is avoided with the use of adaptive filters of orders less than the full-band adaptive filter, which operate at a sampling rate lower than the sampling rate of the input signal. The decomposed signals by analysis bank filter are less correlated in each sub-band than the input signal at full-band, and can promote better rates of convergence.

Keywords: Blind source separation, estimates, full-band, mixtures, sub-band

Procedia PDF Downloads 422

Authors: Fola John Adeyeye

Abstract:

In this paper, we propose a cryptosystem private and public key base on symmetric group Pn and validates its theoretical formulation. This proposed system benefits from the algebraic properties of Pn such as noncommutative high logical, computational speed and high flexibility in selecting key which makes the discrete permutation multiplier logic (DPML) resist to attack by any algorithm such as Pohlig-Hellman. One of the advantages of this scheme is that it explore all the possible triangular symmetries. Against these properties, the only disadvantage is that the law of permutation multiplicity only allow an operation from left to right. Many other cryptosystems can be transformed into their symmetric group.

Keywords: cryptosystem, private and public key, DPML, symmetric group Pn

Procedia PDF Downloads 171

Authors: Noha Seddik, Sherine Youssef, Mohamed Kholeif

Abstract:

The automated epileptic seizure detection research field has emerged in the recent years; this involves analyzing the Electroencephalogram (EEG) signals instead of the traditional visual inspection performed by expert neurologists. In this study, a Support Vector Machine (SVM) that uses Weighted Permutation Entropy (WPE) as the input feature is proposed for classifying normal and seizure EEG records. WPE is a modified statistical parameter of the permutation entropy (PE) that measures the complexity and irregularity of a time series. It incorporates both the mapped ordinal pattern of the time series and the information contained in the amplitude of its sample points. The proposed system utilizes the fact that entropy based measures for the EEG segments during epileptic seizure are lower than in normal EEG.

Keywords: electroencephalogram (EEG), epileptic seizure detection, weighted permutation entropy (WPE), support vector machine (SVM)

Procedia PDF Downloads 341

Authors: Supattra Kanchanopast

Abstract:

The purpose of this research is to develop and design a management information system for 7 eleven shop in Bangkok. The system was designed and developed to meet users’ requirements via the internet network by use of application software such as My SQL for database management, Apache HTTP Server for Web Server and PHP Hypertext Preprocessor for an interface between web server, database and users. The system was designed into two subsystems as the main system, or system for head office, and the branch system for branch shops. These consisted of three parts which are classified by user management as shop management, inventory management and Point of Sale (POS) management. The implementation of the MIS for the mini-mart shop, can lessen the amount of paperwork and reduce repeating tasks so it may decrease the capital of the business and support an extension of branches in the future as well.

Keywords: convenience store, the management information system, inventory management, 7 eleven shop

Procedia PDF Downloads 430

Authors: Punya Tepsing

Abstract:

This research aimed to study the beliefs in auspicious materials of entrepreneurs in Muang Hat Yai. The data were collected via documentary research and field work including interviews, observations shops in Hat Yai which used auspicious materials to bring lucks to the shops. The results were as follows. The beliefs in auspicious materials that the entrepreneurs had were of three areas: 1) The auspicious materials could correct the improperness of the shop location, for example, the shop situated opposite a branch road, a shrine, or a bank. The owner usually corrected it by putting Chinese auspicious materials in front of or in the shop, for example, a lion holding a sword in his mouth, or a mirror, etc. 2) The auspicious materials could bring in more income. The owner of the shop usually put the auspicious materials such as a cat beckoning and a bamboo fish trap believed to trap money in front of or inside the shop. 3) The auspicious materials like turtles, paired fish and a monster holding the moon in his mouth could solve life problems including health, family, and safety problems. The use of these auspicious materials showed the blending of the beliefs of the Chinese shop entrepreneurs with the Thai folk beliefs. What is interesting is that Hat Yai is located near the three southern border provinces which are the unrest area and this may cause the number of tourists to decline. This prompted them to build a mechanism in adjusting themselves both to save their lives and to increase the number of customers. Auspicious materials can make them feel more confident.

Keywords: belief, auspicious materials, shop, entrepreneur, Maung Hat Yai

Procedia PDF Downloads 214

Authors: Essam Al Daoud

Abstract:

Genome rearrangement is an important area in computational biology and bioinformatics. The basic problem in genome rearrangements is to compute the edit distance, i.e., the minimum number of operations needed to transform one genome into another. Unfortunately, unsigned genome rearrangement problem is NP-hard. In this study an improved ant colony optimization algorithm to approximate the edit distance is proposed. The main idea is to convert the unsigned permutation to signed permutation and evaluate the ants by using Kaplan algorithm. Two new operations are added to the standard ant colony algorithm: Replacing the worst ants by re-sampling the ants from a new probability distribution and applying the crossover operations on the best ants. The proposed algorithm is tested and compared with the improved breakpoint reversal sort algorithm by using three datasets. The results indicate that the proposed algorithm achieves better accuracy ratio than the previous methods.

Keywords: ant colony algorithm, edit distance, genome breakpoint, genome rearrangement, reversal sort

Procedia PDF Downloads 316

Authors: Aydin Teymourifar, Gurkan Ozturk

Abstract:

In this paper, a new hybrid Hopfield neural network is proposed for the dynamic, flexible job shop scheduling problem. A new heuristic based and easy to implement energy function is designed for the Hopfield neural network, which penalizes the constraints violation and decreases makespan. Moreover, for enhancing the performance, several heuristics are integrated to it that achieve active, and non-delay schedules also, prevent early convergence of the neural network. The suggested algorithm that is designed as a generalization of the previous studies for the flexible and dynamic scheduling problems can be used for solving real scheduling problems. Comparison of the presented hybrid method results with the previous studies results proves its efficiency.

Keywords: dynamic flexible job shop scheduling, neural network, heuristics, constrained optimization

Procedia PDF Downloads 390

Authors: Hanife Merve Öztürk, Sıdıka Dalgan

Abstract:

In this project, a capacity analysis study is done at TAT A. Ş. Maret Plant. Production capacity of products which generate 80% of sales amount are determined. Obtained data entered the LEKIN Scheduling Program and we get production schedules by using heuristic methods. Besides heuristic methods, as mathematical model, disjunctive programming formulation is adapted to flexible job shop problems by adding a new constraint to find optimal schedule solution.

Keywords: scheduling, flexible job shop problem, shifting bottleneck heuristic, mathematical modelling

Procedia PDF Downloads 369

Authors: Liudmyla Koliechkina, Olena Dvirna

Abstract:

The statement of the multi-objective optimization problem on combinatorial configurations is formulated, and the approach to its solution is proposed. The problem is of interest as a combinatorial optimization one with many criteria, which is a model of many applied tasks. The approach to solving the multi-objective optimization problem on combinatorial configurations consists of two stages; the first is the reduction of the multi-objective problem to the single criterion based on existing multi-objective optimization methods, the second stage solves the directly replaced single criterion combinatorial optimization problem by the horizontal combinatorial method. This approach provides the optimal solution to the multi-objective optimization problem on combinatorial configurations, taking into account additional restrictions for a finite number of steps.

Keywords: discrete set, linear combinatorial optimization, multi-objective optimization, Pareto solutions, partial permutation set, structural graph

Procedia PDF Downloads 136

Authors: Aydin Teymourifar, Gurkan Ozturk, Ozan Bahadir

Abstract:

In this paper, a new neural network based variable neighborhood search is proposed for the multi-objective dynamic, flexible job shop scheduling problems. The neural network controls the problems' constraints to prevent infeasible solutions, while the Variable Neighborhood Search (VNS) applies moves, based on the critical block concept to improve the solutions. Two approaches are used for managing the constraints, in the first approach, infeasible solutions are modified according to the constraints, after the moves application, while in the second one, infeasible moves are prevented. Several neighborhood structures from the literature with some modifications, also new structures are used in the VNS. The suggested neighborhoods are more systematically defined and easy to implement. Comparison is done based on a multi-objective flexible job shop scheduling problem that is dynamic because of the jobs different release time and machines breakdowns. The results show that the presented method has better performance than the compared VNSs selected from the literature.

Keywords: constrained optimization, neural network, variable neighborhood search, flexible job shop scheduling, dynamic multi-objective optimization

Procedia PDF Downloads 321

Authors: Ghada Badr, Manar Hosny, Nuha Bintayyash, Eman Albilali, Souad Larabi Marie-Sainte

Abstract:

The median problem is significantly applied to derive the most reasonable rearrangement phylogenetic tree for many species. More specifically, the problem is concerned with finding a permutation that minimizes the sum of distances between itself and a set of three signed permutations. Genomes with equal number of genes but different order can be represented as permutations. In this paper, an algorithm, namely BeamGA median, is proposed that combines a heuristic search approach (local beam) as an initialization step to generate a number of solutions, and then a Genetic Algorithm (GA) is applied in order to refine the solutions, aiming to achieve a better median with the smallest possible reversal distance from the three original permutations. In this approach, any genome rearrangement distance can be applied. In this paper, we use the reversal distance. To the best of our knowledge, the proposed approach was not applied before for solving the median problem. Our approach considers true biological evolution scenario by applying the concept of common intervals during the GA optimization process. This allows us to imitate a true biological behavior and enhance genetic approach time convergence. We were able to handle permutations with a large number of genes, within an acceptable time performance and with same or better accuracy as compared to existing algorithms.

Keywords: median problem, phylogenetic tree, permutation, genetic algorithm, beam search, genome rearrangement distance

Procedia PDF Downloads 240

Authors: Didem Güven, Oytun Hanhan, Elif Ceren Aksoy, Emine Ubay Çokgör

Abstract:

This paper presents a biological treatability study ofpaintshopwastewaterof a bus factory by an anoxic/aerobic sequencing batch reactor.A lab scale 14L SBR system was implementedto investigate carbon and nitrogen removal performance frompaint shop waste streams combined with domestic and process wastewater of a bus production factory in Istanbul (Turkey).The wastewater collected from decanters of the paint boots and pre-treatmentplant was usedforthefeeding of SBR. The reactor was operated with a total hydraulic retention time of 24 hrs, and a total sludge age of 18.7 days. Initially the efficiency and stability of the reactor were studied when fed with main wastewater stream to simulate the current wastewater treatment plant. Removal efficiency of 57% nitrogen and 90% COD were obtained. Once the paint shop wastewater was introduced to mainstream feeding with a ratio of 1:5, nitrification completely, carbon removal were partially inhibited. SBR system was successful to handle even at very high COD concentrations of paint shop wastewater after feeding of 2 months, with an average effluent COD of 100 mg/L. For the determination of kinetic parameters, respirometric analysis was also conducted with/without paint shop wastewater addition. Model simulation indicated lower maximum specific growth and hydrolysis rates when paint shop wastewater was mixed with the mainstream wastewater of the factory.

Keywords: biological treatability, nitrogen removal, paint shop wastewater, sequencing batch reactor

Procedia PDF Downloads 263

Authors: Max Moleke, Gilbert Mbonde

Abstract:

Coordinating supply chain process within a manufacturing environment is a very critical aspect of any organization. Nowadays, most manufacturing industries turn to look at only the financial indicator which in real life situation on the shop floor, there are a number of supply chain disruptions that are been ignored. In this work, we had to look at different types of supply chain disruption and their various impact within the organization. A number of Industrial engineering tools are employed which includes, Multifactor productivity, activity on arrow and rescheduling plans. The final result shows that supply chain disruption various with different geographical area where the production plant is operating.

Keywords: supply chain, disruptions, flow shop scheduling, uncertainty

Procedia PDF Downloads 395

Authors: H.-H. Doh, J.-M. Yu, Y.-J. Kwon, J.-H. Shin, H.-W. Kim, S.-H. Nam, D.-H. Lee

Abstract:

This paper suggests a decision tree based approach for flexible job shop scheduling with multiple process plans, i. e. each job can be processed through alternative operations, each of which can be processed on alternative machines. The main decision variables are: (a) selecting operation/machine pair; and (b) sequencing the jobs assigned to each machine. As an extension of the priority scheduling approach that selects the best priority rule combination after many simulation runs, this study suggests a decision tree based approach in which a decision tree is used to select a priority rule combination adequate for a specific system state and hence the burdens required for developing simulation models and carrying out simulation runs can be eliminated. The decision tree based scheduling approach consists of construction and scheduling modules. In the construction module, a decision tree is constructed using a four-stage algorithm, and in the scheduling module, a priority rule combination is selected using the decision tree. To show the performance of the decision tree based approach suggested in this study, a case study was done on a flexible job shop with reconfigurable manufacturing cells and a conventional job shop, and the results are reported by comparing it with individual priority rule combinations for the objectives of minimizing total flow time and total tardiness.

Keywords: flexible job shop scheduling, decision tree, priority rules, case study

Procedia PDF Downloads 314

Authors: S. Nasri, H. Bouziri

Abstract:

Disasters are quite experienced in our days. They are caused by floods, landslides, and building fires that is the main objective of this study. To cope with these unexpected events, precautions must be taken to protect human lives. The emphasis on disposal work focuses on the resolution of the evacuation problem in case of no-notice disaster. The problem of evacuation is listed as a dynamic network flow problem. Particularly, we model the evacuation problem as an earliest arrival flow problem with load dependent transit time. This problem is classified as NP-Hard. Our challenge here is to propose a metaheuristic solution for solving the evacuation problem. We define our objective as the maximization of evacuees during earliest periods of a time horizon T. The objective provides the evacuation of persons as soon as possible. We performed an experimental study on emergency evacuation from the tunisian children’s hospital. This work prompts us to look for evacuation plans corresponding to several situations where the network dynamically changes.

Keywords: dynamic network flow, load dependent transit time, evacuation strategy, earliest arrival flow problem, tabu search metaheuristic

Procedia PDF Downloads 346

Authors: Mohand Kessal, Rachid Boucetta, Mourad Tikobaini, Mohammed Zamoum

Abstract:

Leakage problem of two-component fluids flow is modeled for a transient one-dimensional homogeneous bubbly flow and developed by taking into account the effect of a leak located at the middle point of the pipeline. The corresponding three conservation equations are numerically resolved by an improved characteristic method. The obtained results are explained and commented in terms of physical impact on the flow parameters.

Keywords: fluid transients, pipelines leaks, method of characteristics, leakage problem

Procedia PDF Downloads 445

Authors: M. Bouinoun, M. Bouhadef

Abstract:

The present study is concerned with the problem of determining the shape of the free surface flow in a hydraulic channel which has an uneven bottom. For the mathematical formulation of the problem, the fluid of the two-dimensional irrotational steady flow in water is assumed inviscid and incompressible. The solutions of the nonlinear problem are obtained by using the usual conformal mapping theory and Hilbert’s technique. An experimental study, for comparing the obtained results, has been conducted in a hydraulic channel (subcritical regime and supercritical regime).

Keywords: free-surface flow, experiments, numerical method, uneven bottom, supercritical regime, subcritical regime

Procedia PDF Downloads 353

Authors: Saeideh Salimpour, Sophie-Charlotte Viaux, Ahmed Azab, Mohammed Fazle Baki

Abstract:

The Facility Layout Problem (FLP) is key to the efficient and cost-effective operation of a system. This paper presents a hybrid heuristic- and mathematical-programming-based approach that divides the problem conceptually into those of clustering and sequencing. First, clusters of vertically aligned facilities are formed, which are later on sequenced horizontally. The developed methodology provides promising results in comparison to its counterparts in the literature by minimizing the inter-distances for facilities which have more interactions amongst each other and aims at placing the facilities with more interactions at the centroid of the shop.

Keywords: clustering-sequencing approach, mathematical modeling, optimization, unequal facility layout problem

Procedia PDF Downloads 303

Authors: Zineddine Bouyahiaoui, Rabah Haoui

Abstract:

The aim of this work is to analyze a flow around the axisymmetric blunt body taken into account the chemical and vibrational nonequilibrium flow. This work concerns the entry of spacecraft in the atmosphere of the planet Mars. Since the equations involved are non-linear partial derivatives, the volume method is the only way to solve this problem. The choice of the mesh and the CFL is a condition for the convergence to have the stationary solution.

Keywords: blunt body, finite volume, hypersonic flow, viscous flow

Procedia PDF Downloads 208

Authors: Lal Hussain, Wajid Aziz, Sajjad Ahmed Nadeem, Saeed Arif Shah, Abdul Majid

Abstract:

Brain electrical activity as reflected in Electroencephalography (EEG) have been analyzed and diagnosed using various techniques. Among them, complexity measure, nonlinearity, disorder, and unpredictability play vital role due to the nonlinear interconnection between functional and anatomical subsystem emerged in brain in healthy state and during various diseases. There are many social and economical issues of alcoholic abuse as memory weakness, decision making, impairments, and concentrations etc. Alcoholism not only defect the brains but also associated with emotional, behavior, and cognitive impairments damaging the white and gray brain matters. A recently developed signal analysis method i.e. Multiscale Permutation Entropy (MPE) is proposed to estimate the complexity of long-range temporal correlation time series EEG of Alcoholic and Control subjects acquired from University of California Machine Learning repository and results are compared with MSE. Using MPE, coarsed grained series is first generated and the PE is computed for each coarsed grained time series against the electrodes O1, O2, C3, C4, F2, F3, F4, F7, F8, Fp1, Fp2, P3, P4, T7, and T8. The results computed against each electrode using MPE gives higher significant values as compared to MSE as well as mean rank differences accordingly. Likewise, ROC and Area under the ROC also gives higher separation against each electrode using MPE in comparison to MSE.

Keywords: electroencephalogram (EEG), multiscale permutation entropy (MPE), multiscale sample entropy (MSE), permutation entropy (PE), mann whitney test (MMT), receiver operator curve (ROC), complexity measure

Procedia PDF Downloads 461

Authors: Anocha Rojanapanich

Abstract:

The purpose of this research is to develop and design an accounting management information system for convenient shop in Bangkok Thailand. The study applied the System Development Life Cycle (SDLC) for development which began with study and analysis of current data, including the existing system. Then, the system was designed and developed to meet users’ requirements via the internet network by use of application software such as My SQL for database management, Product diversity, Apache HTTP Server for Web Server and PHP Hypertext Preprocessor for an interface between web server, database and users. The system was designed into two subsystems as the main system, or system for head office, and the branch system for branch shops. These consisted of three parts which are classified by user management as shop management, inventory management and Point of Sale (POS) management and importance of cost information for decision making also as well as.

Keywords: accounting management information system, convenient shop, cost information for decision making system, development life cycle

Procedia PDF Downloads 394

Authors: Kiurski S. Jelena, Kecić S. Vesna, Oros B. Ivana, Ranogajec G. Jonjaua

Abstract:

The paper represents the dependence of ammonia concentration on microclimate parameters and photocopying shop circulation. The concentration of ammonia was determined during 8-hours working time over five days including three sampling points of a photocopying shop in Novi Sad, Serbia. The obtained results pointed out that the room temperature possesses the highest impact on ammonia release. The obtained ammonia concentration was in the range of 1.53 to 0.42ppm and decreased with the temperature decreasing from 24.6 to 20.7 °C. As the detected concentrations were within the permissible levels of The Occupational Safety and Health Administration, The National Institute for Occupational Safety and The Health and Official Gazette of Republic of Serbia, in the range of 35 to 200ppm, there was no danger to the employee’s health in the photocopying shop.

Keywords: ammonia, emission, indoor environment, photocopying procedure

Procedia PDF Downloads 376

Authors: Raphael Zanella, Todd A. Oliver, Karl W. Schulz

Abstract:

This work deals with the finite element approximation of axisymmetric compressible flows with swirl velocity. We are interested in problems where the flow, while weakly dependent on the azimuthal coordinate, may have a strong azimuthal velocity component. We describe the approximation of the compressible Navier-Stokes equations with H1-conformal spaces of axisymmetric functions. The weak formulation is implemented in a C++ solver with explicit time marching. The code is first verified with a convergence test on a manufactured solution. The verification is completed by comparing the numerical and analytical solutions in a Poiseuille flow case and a Taylor-Couette flow case. The code is finally applied to the problem of a swirling subsonic air flow in a plasma torch geometry.

Keywords: axisymmetric problem, compressible Navier-Stokes equations, continuous finite elements, swirling flow

Procedia PDF Downloads 148

Authors: Triloki Nath, R. K. Gupta, L. P. Singh

Abstract:

The aim of this paper is to find the new exact solution of the blast wave problem in one-dimensional unsteady adiabatic flow for generalized geometry in a compressible, inviscid ideal gas with dust particles. The density of the undisturbed region is assumed to vary according to a power law of the distance from the point of explosion. The exact solution of the problem in form of a power in the distance and the time is obtained. Further, the behaviour of the total energy carried out by the blast wave for planar, cylindrically symmetric and spherically symmetric flow corresponding to different Mach number of the fluid flow in dusty gas is presented. It is observed that the presence of dust particles in the gas yields more complex expression as compared to the ordinary Gasdynamics.

Keywords: shock wave, blast wave, dusty gas, strong shock

Procedia PDF Downloads 294

Authors: Pushpendra Kumar, Sanjeev Kumar, R. Balasubramanian

Abstract:

Estimation of optical flow from a sequence of images using variational methods is one of the most successful approach. Discontinuity between different motions is one of the challenging problem in flow estimation. In this paper, we design a new anisotropic diffusion operator, which is able to provide smooth flow over a region and efficiently preserve discontinuity in optical flow. This operator is designed on the basis of intensity differences of the pixels and isotropic operator using exponential function. The combination of these are used to control the propagation of flow. Experimental results on the different datasets verify the robustness and accuracy of the algorithm and also validate the effect of anisotropic operator in the discontinuity preserving.

Keywords: optical flow, variational methods, computer vision, anisotropic operator

Procedia PDF Downloads 840

Authors: A. Sadowska, R. Polaniak, P. Boczarski, E. Grochowska-Niedworok

Abstract:

Working in a shopping center 12 hours a day as a shop assistant is a very demanding and stressful job, which is still underestimated. Proper eating habits, including recommended fruits, vegetables, products rich in fiber, omega-3 fatty acids, and proper hydration, can contribute to improvement in health and make shop assistants more resistant to stress. The aim of this study was to analyze the eating habits of shop assistants working in shopping centers 12 hours a day. Participant 101 sellers from Poland filled out authorial surveys. Nearly 50% of participants consumed the recommended number of 4 to 5 meals per day. There was a slight dependence between the number of meals consumed per day and the time that employers allowed for employee mealtimes. Respondents declared that they engaged in snacking, and they generally chose fruit, chocolates, and other sweets. Survey results indicated a low liquid intake, which was about 1,05 liters daily. Mineral water was chosen most often (63%) by participants. Participant fish consumption was very low in comparison with the norms, which can pose a risk of developing omega-3 fatty acids deficiency. Shop assistants stated that a change in their eating habits was necessary. Study findings suggest a moderate dependence between being on a diet and counting calories and macronutrients contained in meals. The number of meals eaten per day is correlated with the number of meals eaten at the worksite. The percentage of snacking by shop assistants was so high that it suggested a need for more nutrition education. The topic of eating habits among shop assistants should be examined using a larger group of participants. It is necessary to note a connection between nutrition and health problems.

Keywords: eating habits, work during 12 hours a day, shopping center, nutrition

Procedia PDF Downloads 100

Authors: Georgios Pardalis, Krushna Mahapatra, Brijesh Mainali

Abstract:

Compared to other sectors, the residential and service sector in Sweden is responsible for almost 40% of the national final energy use and faces great challenges towards achieving reduction of energy intensity. The one- and two-family (henceforth 'detached') houses, constituting 60% of the residential floor area and using 32 TWh for space heating and hot water purposes, offers significant opportunities for improved energy efficiency. More than 80% of those houses are more than 35 years of old and a large share of them need major renovations. However, the rate of energy renovations for such houses is significantly low. The renovation market is dominated by small and medium-sized local companies (SMEs), who mostly offer individual solutions. A one-stop-shop business framework, where a single actor collaborates with other actors and coordinates them to offer a full package for holistic renovations, may speed up the rate of renovation. Such models are emerging in some European countries. This paper aims to understand the willingness of the SMEs to adopt a one-stop-shop business framework. Interviews were conducted with 13 SMEs in Kronoberg county in Sweden, a geographic region known for its initiatives towards sustainability and energy efficiency. The examined firms seem reluctant to adopt one-stop-shop for nonce due to the perceived risks they see in such a business move and due to their characteristics, although they agree that such a move will advance their position in the market and their business volume. By using threat-rigidity and prospect theory, we illustrate how this type of companies can move from being reluctant to adopt one-stop-shop framework to its adoption. Additionally, with the use of behavioral theory, we gain deeper knowledge on those exact reasons preventing those firms from adopting the one-stop-shop framework.

Keywords: construction SMEs, innovation adoption, one-stop-shop, perceived risks

Procedia PDF Downloads 102