Search results for: task scheduling

Authors: Aydin Teymourifar, Gurkan Ozturk

Abstract:

In this paper, a new hybrid particle swarm optimization algorithm is proposed for the multi-objective flexible job shop scheduling problem that is very important and hard combinatorial problem. The Pareto approach is used for solving the multi-objective problem. Several new local search heuristics are integrated into an algorithm based on the critical block concept to enhance the performance of the algorithm. The algorithm is compared with the recently published multi-objective algorithms based on benchmarks selected from the literature. Several metrics are used for quantifying performance and comparison of the achieved solutions. The algorithms are also compared based on the Weighting summation of objectives approach. The proposed algorithm can find the Pareto solutions more efficiently than the compared algorithms in less computational time.

Keywords: swarm-based optimization, local search, Pareto optimality, flexible job shop scheduling, multi-objective optimization

Procedia PDF Downloads 354

Authors: Abdelhadi Adel, Kadri Ouahab

Abstract:

This paper proposes an improved approach based on MAS Architecture and Heuristic Algorithm for systematic maintenance to minimize makespan. We have implemented a problem-solving approach for optimizing the processing time, methods based on metaheuristics. The proposed approach is inspired by the behavior of the human body. This hybridization is between a multi-agent system and inspirations of the human body, especially genetics. The effectiveness of our approach has been demonstrated repeatedly in this paper. To solve such a complex problem, we proposed an approach which we have used advanced operators such as uniform crossover set and single point mutation. The proposed approach is applied to three preventive maintenance policies. These policies are intended to maximize the availability or to maintain a minimum level of reliability during the production chain. The results show that our algorithm outperforms existing algorithms. We assumed that the machines might be unavailable periodically during the production scheduling.

Keywords: multi-agent systems, emergence, genetic algorithm, makespan, systematic maintenance, scheduling, hybrid flow shop scheduling

Procedia PDF Downloads 276

Authors: Riya Mishra, Trayambak Tiwari, Anju Lata Singh, I. L. Singh, Tara Singh

Abstract:

Decrement in vigilance task performance echoes impediment in effortful attention; here attention fluctuated in the realm of external and internal milieu of a person. To examine this fluctuation across time period, we employed two experiments of vigilance task with variation in thought probing rate, which was embedded in the task. The thought probe varies in terms of <2 minute per thought probe and <4 minute per thought probe during vigilance task. A 2x4 repeated measure factorial design was used. 15 individuals participated in this study with an age range of 20-26 years. It was found that thought probing rate has a negative trend with vigilance task performance whereas the subjective measures of mind-wandering have a positive relation with thought probe rate.

Keywords: criterion response, mental status, mind-wandering, thought probe, vigilance

Procedia PDF Downloads 396

Authors: Guilherme Gorgulho, Carlos Roberto Camello Lima

Abstract:

Due to the competitive market in which companies are currently engaged, the constant changes require companies to react quickly regarding the variability of demand and process. The changes are caused by customers, or by demand fluctuations or variations of products, or the need to serve customers within agreed delivery taking into account the continuous search for quality and competitive prices in products. These changes end up influencing directly or indirectly the activities of the Planning and Production Control (PPC), which does business in strategic, tactical and operational levels of production systems. One area of concern for organizations is in the short term (operational level), because this planning stage any error or divergence will cause waste and impact on the delivery of products on time to customers. Thus, this study aims to optimize the efficiency of production scheduling, using different sequencing strategies in an automotive company. Seeking to aim the proposed objective, we used the computer simulation in conjunction with lean manufacturing to build and validate the current model, and subsequently the creation of future scenarios.

Keywords: computational simulation, lean manufacturing, production scheduling, sequencing strategies

Procedia PDF Downloads 252

Authors: G. M. Komaki, S. Mobin, E. Teymourian, S. Sheikh

Abstract:

This paper addresses minimizing the makespan of the distributed permutation flow shop scheduling problem. In this problem, there are several parallel identical factories or flowshops each with series of similar machines. Each job should be allocated to one of the factories and all of the operations of the jobs should be performed in the allocated factory. This problem has recently gained attention and due to NP-Hard nature of the problem, metaheuristic algorithms have been proposed to tackle it. Majority of the proposed algorithms require large computational time which is the main drawback. In this study, a general variable neighborhood search algorithm (GVNS) is proposed where several time-saving schemes have been incorporated into it. Also, the GVNS uses the sophisticated method to change the shaking procedure or perturbation depending on the progress of the incumbent solution to prevent stagnation of the search. The performance of the proposed algorithm is compared to the state-of-the-art algorithms based on standard benchmark instances.

Keywords: distributed permutation flow shop, scheduling, makespan, general variable neighborhood search algorithm

Procedia PDF Downloads 337

Authors: Sanat Ramesh, Tarun Dutt, Abhilasha Aswal, Anushka Chandrababu, G. N. Srinivasa Prasanna

Abstract:

Optimal Schedule Generation for a large national railway network operating thousands of passenger trains with tens of thousands of kilometers of track is a grand computational challenge in itself. We present heuristics based on a Mixed Integer Program (MIP) formulation for local optimization. These methods provide flexibility in scheduling new trains with varying speed and delays and improve utilization of infrastructure. We propose methods that provide a robust solution with hundreds of trains being scheduled over a portion of the railway network without significant increases in delay. We also provide techniques to validate the nominal schedules thus generated over global correlated variations in travel times thereby enabling us to detect conflicts arising due to delays. Our validation results which assume only the support of the arrival and departure time distributions takes an order of few minutes for a portion of the network and is computationally efficient to handle the entire network.

Keywords: mixed integer programming, optimization, railway network, train scheduling

Procedia PDF Downloads 134

Authors: Nur Aidya Hanum Aizam, Vikneswary Uvaraja

Abstract:

The agenda of showing the scheduled time for performing certain tasks is known as timetabling. It widely used in many departments such as transportation, education, and production. Some difficulties arise to ensure all tasks happen in the time and place allocated. Therefore, many researchers invented various programming model to solve the scheduling problems from several fields. However, the studies in developing the general integer programming model for many timetabling problems are still questionable. Meanwhile, this thesis describe about creating a general model which solve different types of timetabling problems by considering the basic constraints. Initially, the common basic constraints from five different fields are selected and analyzed. A general basic integer programming model was created and then verified by using the medium set of data obtained randomly which is much similar to realistic data. The mathematical software, AIMMS with CPLEX as a solver has been used to solve the model. The model obtained is significant in solving many timetabling problems easily since it is modifiable to all types of scheduling problems which have same basic constraints.

Keywords: AIMMS mathematical software, integer linear programming, scheduling problems, timetabling

Procedia PDF Downloads 414

Authors: Rajamani Doraiswami, Lahouari Cheded

Abstract:

Fault diagnosis of Linear Parameter-Varying (LPV) system using an adaptive Kalman filter is proposed. The LPV model is comprised of scheduling parameters, and the emulator parameters. The scheduling parameters are chosen such that they are capable of tracking variations in the system model as a result of changes in the operating regimes. The emulator parameters, on the other hand, simulate variations in the subsystems during the identification phase and have negligible effect during the operational phase. The nominal model and the influence vectors, which are the gradient of the feature vector respect to the emulator parameters, are identified off-line from a number of emulator parameter perturbed experiments. A Kalman filter is designed using the identified nominal model. As the system varies, the Kalman filter model is adapted using the scheduling variables. The residual is employed for fault diagnosis. The proposed scheme is successfully evaluated on simulated system as well as on a physical process control system.

Keywords: identification, linear parameter-varying systems, least-squares estimation, fault diagnosis, Kalman filter, emulators

Procedia PDF Downloads 478

Authors: Sina Keyhanian, Abbas Ahmadi, Behrooz Karimi

Abstract:

We present a multi-objective binary programming model which considers surgical cases are scheduling among operating rooms and the configuration of surgical instruments in limited capacity hospital trays, simultaneously. Many mathematical models have been developed previously in the literature addressing different challenges in health-care logistics such as assigning operating rooms, leveling beds, etc. But what happens inside the operating rooms along with the inventory management of required instruments for various operations, and also their integration with surgical scheduling have been poorly discussed. Our model considers the minimization of movements between trays during a surgery which recalls the famous cell formation problem in group technology. This assumption can also provide a major potential contribution to robotic surgeries. The tray configuration problem which consumes surgical instruments requirement plan (SIRP) and sequence of surgical procedures based on required instruments (SIRO) is nested inside the bin packing problem. This modeling approach helps us understand that most of the same-output solutions will not be necessarily identical when it comes to the rearrangement of surgeries among rooms. A numerical example has been dealt with via a proposed nested simulated annealing (SA) optimization approach which provides insights about how various configurations inside a solution can alter the optimal condition.

Keywords: health-care logistics, hospital tray configuration, off-line bin packing, simulated annealing optimization, surgical case scheduling

Procedia PDF Downloads 254

Authors: Yu-Jen Chang, Yun Chen, Hei-Lam Wong

Abstract:

The Economic Lot Scheduling Problem (ELSP) is a valuable mathematical model that can support decision-makers to make scheduling decisions. The basic period approach is effective for solving the ELSP. The assumption for applying the basic period approach is that a product must use its maximum production rate to be produced. However, a product can lower its production rate to reduce the average total cost when a facility has extra idle time. The past researches discussed how a product adjusts its production rate under the common cycle approach. To the best of our knowledge, no studies have addressed how a product lowers its production rate under the basic period approach. This research is the first paper to discuss this topic. The research develops a simple fixed rate approach that adjusts the production rate of a product under the basic period approach to solve the ELSP. Our numerical example shows our approach can find a better solution than the traditional basic period approach. Our mathematical model that applies the fixed rate approach under the basic period approach can serve as a reference for other related researches.

Keywords: economic lot, basic period, genetic algorithm, fixed rate

Procedia PDF Downloads 546

Authors: Amir Zand-Moghadam, Mahnaz Alizadeh

Abstract:

The aim of the present study was to investigate the effect of teacher-scaffolding versus peer-scaffolding on EFL learners’ metapragmatic awareness in the paradigm of task-based language teaching (TBLT). To this end, a number of dialogic information-gap tasks requiring two-way interactant relationship were designed for the five speech acts of request, refusal, apology, suggestion, and compliment following Ellis’s (2003) model. Then, 48 intermediate EFL learners were randomly selected, homogenized, and assigned to two groups: 26 participants in the teacher-scaffolding group (Group One) and 22 in the peer-scaffolding group (Group Two). While going through the three phases of pre-task, while-task, and post-task, the participants in the first group completed the designed tasks by the teacher’s interaction, scaffolding, and feedback. On the other hand, the participants in the second group were required to complete the tasks in expert-novice pairs through peer scaffolding in all the three phases of a task-based syllabus. The findings revealed that the participants in the teacher-scaffolding group developed their L2 metapragmatic awareness more than the peer-scaffolding group. Thus, it can be concluded that teacher-scaffolding is more effective than peer scaffolding in developing metapragmatic awareness among EFL learners. It can also be claimed that the use of tasks can be more influential when they are accompanied by teacher-scaffolding. The findings of the present study have implications for language teachers and researchers.

Keywords: ILP, metapragmatic awareness, scaffolding, task-based instruction

Procedia PDF Downloads 560

Authors: Harshdeep Singh, Kuljeet Singh Anand

Abstract:

Background: Cerebrovascular Accidents (CVA) cause abnormal or asymmetrical tendon reflexes contributing to motor impairments. Since the tendon reflexes are mediated by the spinal cord, their effects on cognitive performances are overlooked. This study aims to find the contributions of tendon reflexes on the performance of the Flanker task. Methods: A total population of 46 mixed subjects with movement disorders were recruited for the study. Deep tendon reflexes (DTR) of the biceps, triceps and brachioradialis were assessed for both upper extremities. Later, the Flanker task was performed on all the subjects, and the mean Reaction Time (RT) along with both the congruent and incongruent stimuli were evaluated. For the final analysis, the Kruskal Wallis test was performed to see the difference between the DTR and the performance of the Flanker Task. Results: The Kruskal Wallis test results showed a significant difference between the DTR scores, X²(2) = 11.328, p= 0.023 with the mean RT of the flanker task and X²(2) = 9.531, p= 0.049 with mean RT of the Incongruent Stimuli. Whereas the result found a non-significant difference in the mean RT of the Congruent Stimuli. Conclusion: Each DTR score is distributed differently with the mean RT of the flanker task and for the incongruent stimuli as well. Therefore, the tendon reflexes in PD may be contributing to the performance of the Flanker Task and may be an indicator of abnormal cognitive performance. Further research is needed to evaluate how the RTs are distributed with each DTR score.

Keywords: cerebrovascular accidents, deep tendon reflexes, flanker task, reaction time, congruent stimuli, incongruent stimuli

Procedia PDF Downloads 72

Authors: Rui Wu

Abstract:

In the volatile modern manufacturing environment, new orders randomly occur at any time, while the pre-emptive methods are infeasible. This leads to a real-time scheduling method that can produce a reasonably good schedule quickly. The dynamic Flexible Job Shop problem is an NP-hard scheduling problem that hybrid the dynamic Job Shop problem with the Parallel Machine problem. A Flexible Job Shop contains different work centres. Each work centre contains parallel machines that can process certain operations. Many algorithms, such as genetic algorithms or simulated annealing, have been proposed to solve the static Flexible Job Shop problems. However, the time efficiency of these methods is low, and these methods are not feasible in a dynamic scheduling problem. Therefore, a dynamic rule selection scheduling system based on the reinforcement learning method is proposed in this research, in which the dynamic Flexible Job Shop problem is divided into several parallel machine problems to decrease the complexity of the dynamic Flexible Job Shop problem. Firstly, the features of jobs, machines, work centres, and flexible job shops are selected to describe the status of the dynamic Flexible Job Shop problem at each decision point in each work centre. Secondly, a framework of reinforcement learning algorithm using a double-layer deep Q-learning network is applied to select proper composite dispatching rules based on the status of each work centre. Then, based on the selected composite dispatching rule, an available operation is selected from the waiting buffer and assigned to an available machine in each work centre. Finally, the proposed algorithm will be compared with well-known dispatching rules on objectives of mean tardiness, mean flow time, mean waiting time, or mean percentage of waiting time in the real-time Flexible Job Shop problem. The result of the simulations proved that the proposed framework has reasonable performance and time efficiency.

Keywords: dynamic scheduling problem, flexible job shop, dispatching rules, deep reinforcement learning

Procedia PDF Downloads 80

Authors: Jingya You, Yongqiang Chen, Yuanyuan Hua, Wenqian Wang

Abstract:

Conflict is commonplace in construction projects, and construction projects always involve designing contracts between the owner and the contractor. However, how the contract affects the level of conflict between the owner and the contractor has not been elaborated. The purpose of this paper is to explain the effects of contractual complexity on the level of conflict, including task conflict and relationship conflict, and then to demonstrate the moderating role played by the interdependence between the owner and the contractor. Using data from owners and general contractors in the Chinese construction industry, this research reveals that contractual control will reduce relationship conflict. Contractual coordination will also reduce relationship conflict by the mediating effect of task conflict. Besides, under high joint interdependence, the positive relationship between task conflict and relationship conflict is strengthened, while high interdependence asymmetry has effects on weakening the relationship between task conflict and relationship conflict. The findings provide guidance for contract designers to draft suitable contracts in order to effectively deal with conflict. Additionally, this research implies that project managers should highlight the importance of contract in conflict management.

Keywords: construction projects, contract governance, interdependence, relationship conflict, task conflict

Procedia PDF Downloads 193

Authors: Haojie Wang, Xun Li, Rui Yin

Abstract:

In order to solve the memorization overfitting in the meta-learning MAML algorithm, a method of generating mutually exclusive tasks based on data augmentation is proposed. This method generates a mutex task by corresponding one feature of the data to multiple labels, so that the generated mutex task is inconsistent with the data distribution in the initial dataset. Because generating mutex tasks for all data will produce a large number of invalid data and, in the worst case, lead to exponential growth of computation, this paper also proposes a key data extraction method, that only extracts part of the data to generate the mutex task. The experiments show that the method of generating mutually exclusive tasks can effectively solve the memorization overfitting in the meta-learning MAML algorithm.

Keywords: data augmentation, mutex task generation, meta-learning, text classification.

Procedia PDF Downloads 74

Authors: Carolina Silva, João Nuno Oliveira, Rui Sousa, João Paulo Silva

Abstract:

This study uses genetic algorithms to solve a job scheduling problem in a weaving factory. The underline problem regards an NP-Hard problem concerning unrelated parallel machines, with sequence-dependent setup times. This research uses real data regarding a weaving industry located in the North of Portugal, with a capacity of 96 looms and a production, on average, of 440000 meters of fabric per month. Besides, this study includes a high level of complexity once most of the real production constraints are applied, and several real data instances are tested. Topics such as data analyses and algorithm performance are addressed and tested, to offer a solution that can generate reliable and due date results. All the approaches will be tested in the operational environment, and the KPIs monitored, to understand the solution's impact on the production, with a particular focus on the total number of weeks of late deliveries to clients. Thus, the main goal of this research is to develop a solution that allows for the production of automatically optimized production plans, aiming to the tardiness minimizing.

Keywords: genetic algorithms, textile industry, job scheduling, optimization

Procedia PDF Downloads 133

Authors: Murat Erkoc, Kadir Ertogral

Abstract:

Maintenance, repair and overhauling (MRO) of high cost equipment used in many industries such as transportation, military and construction are typically subject to regulations set by local governments or international agencies. Aircrafts are prime examples for this kind of equipment. Such equipment must be overhauled at certain intervals for continuing permission of use. As such, the overhaul must be completed by strict deadlines, which often times cannot be exceeded. Due to the fact that the overhaul is typically a long process, MRO companies carry so called rotable inventory for exchange of expensive modules in the overhaul process of the equipment so that the equipment continue its services with minimal interruption. The extracted module is overhauled and returned back to the inventory for future exchange, hence the name rotable inventory. However, since the rotable inventory and overhaul capacity are limited, it may be necessary to carry out some of the exchanges earlier than their deadlines in order to produce a feasible overhaul schedule. An early exchange results with a decrease in the equipment’s cycle time in between overhauls and as such, is not desired by the equipment operators. This study introduces an integer programming model for the optimal overhaul and exchange scheduling. We assume that there is certain number of rotables at hand at the beginning of the planning horizon for a single type module and there are multiple demands with known deadlines for the exchange of the modules. We consider an MRO system with identical parallel processing lines. The model minimizes total earliness by generating optimal overhaul start times for rotables on parallel processing lines and exchange timetables for orders. We develop a fast exact solution algorithm for the model. The algorithm employs full-delay scheduling approach with backward allocation and can easily be used for overhaul scheduling problems in various MRO settings with modular rotable items. The proposed procedure is demonstrated by a case study from the aerospace industry.

Keywords: rotable inventory, full-delay scheduling, maintenance, overhaul, total earliness

Procedia PDF Downloads 521

Authors: Haojie Wang, Xun Li, Rui Yin

Abstract:

In order to solve the memorization overfitting in the model-agnostic meta-learning MAML algorithm, a method of generating mutually exclusive tasks based on data augmentation is proposed. This method generates a mutex task by corresponding one feature of the data to multiple labels so that the generated mutex task is inconsistent with the data distribution in the initial dataset. Because generating mutex tasks for all data will produce a large number of invalid data and, in the worst case, lead to an exponential growth of computation, this paper also proposes a key data extraction method that only extract part of the data to generate the mutex task. The experiments show that the method of generating mutually exclusive tasks can effectively solve the memorization overfitting in the meta-learning MAML algorithm.

Keywords: mutex task generation, data augmentation, meta-learning, text classification.

Procedia PDF Downloads 116

Authors: Jihoon Lim, Patrick Kirchen, Ryozo Nagamune

Abstract:

This paper proposes a linear parameter-varying (LPV) controller capable of reducing nitrogen oxide (NOx) emissions with low ammonia (NH3) slip downstream of selective catalytic reduction (SCR) systems. SCR systems are widely adopted in diesel engines due to high NOx conversion efficiency. However, the nonlinearity of the SCR system and sensor uncertainty result in a challenging control problem. In order to overcome the control challenges, an LPV controller is proposed based on gain-scheduling parameters, that is, exhaust gas temperature and exhaust gas flow rate. Based on experimentally obtained data under the non-road transient driving cycle (NRTC), the simulations firstly show that the proposed controller yields high NOx conversion efficiency with a desired low NH3 slip. The performance of the proposed LPV controller is then compared with other controllers, including a gain-scheduling PID controller and a sliding mode controller. Additionally, the robustness is also demonstrated using the uncertainties ranging from 10 to 30%. The results show that the proposed controller is robustly stable under uncertainties.

Keywords: diesel engine, gain-scheduling control, linear parameter-varying, selective catalytic reduction

Procedia PDF Downloads 130

Authors: Roland Lachmayer, Mahtab Afsari

Abstract:

Research is the cornerstone for advancement of human communities. So that it is one of the indexes for evaluating advancement of countries. Research projects are usually cost and time-consuming and do not end in result in short term. Project scheduling is one of the integral parts of project management. The present article offers a new method by using C# and Matlab software to solve Fuzzy GERT networks for Exclusive-OR kind of nodes to schedule the network. In this article we concentrate on flowcharts that we used in Matlab to show how we apply Matlab to schedule Exclusive-OR nodes.

Keywords: research projects, fuzzy GERT, fuzzy CPM, CPM, α-cuts, scheduling

Procedia PDF Downloads 372

Authors: Aslı Yörük, Mevla Yahya, Banu Tavat

Abstract:

It is well established that bilinguals outperform monolinguals on executive function tasks. However, the effects of bilingualism on prospective memory (PM), which also requires executive functions, have not been investigated vastly. This study aimed to compare bi and monolingual participants' PM performance in focal and non-focal PM tasks. Considering that bilinguals have greater executive function abilities than monolinguals, we predict that bilinguals’ PM performance would be higher than monolinguals on the non-focal PM task, which requires controlled monitoring processes. To investigate these predictions, we administered the focal and non-focal PM task and measured the PM and ongoing task performance. Forty-eight Turkish-English bilinguals residing in North Macedonia and forty-eight Turkish monolinguals living in Turkey between the ages of 18-30 participated in the study. They were instructed to remember responding to rarely appearing PM cues while engaged in an ongoing task, i.e., spatial working memory task. The focality of the task was manipulated by giving different instructions for PM cues. In the focal PM task, participants were asked to remember to press an enter key whenever a particular target stimulus appeared in the working memory task; in the non-focal PM task, instead of responding to a specific target shape, participants were asked to remember to press the enter key whenever the background color of the working memory trials changes to a specific color (yellow). To analyze data, we performed a 2 × 2 mixed factorial ANOVA with the task (focal versus non-focal) as a within-subject variable and language group (bilinguals versus monolinguals) as a between-subject variable. The results showed no direct evidence for a bilingual advantage in PM. That is, the group’s performance did not differ in PM accuracy and ongoing task accuracy. However, bilinguals were overall faster in the ongoing task, yet this was not specific to PM cue’s focality. Moreover, the results showed a reversed effect of PM cue's focality on the ongoing task performance. That is, both bi and monolinguals showed enhanced performance in the non-focal PM cue task. These findings raise skepticism about the literature's prevalent findings and theoretical explanations. Future studies should investigate possible alternative explanations.

Keywords: bilingualism, executive functions, focality, prospective memory

Procedia PDF Downloads 94

Authors: Lídia E. O. Cruz, Adriano P. C. Calvo, Renato J. Soares, Regiane A. Carvalho

Abstract:

Individuals with non-specific chronic low back pain may present altered movement patterns during functional activities. However, muscle behavior before and after performing a functional task with different load conditions is not yet fully understood. The aim of this study is to analyze lumbar muscle activity before and after performing the functional task of picking up and placing an object on the ground (with and without load) in individuals with nonspecific chronic low back pain. 20 subjects with nonspecific chronic low back pain and 20 healthy subjects participated in this study. A surface electromyography was performed in the ilio-costal, longissimus and multifidus muscles to evaluate lumbar muscle activity before and after performing the functional task of picking up and placing an object on the ground, with and without load. The symptomatic participants had greater lumbar muscle activation compared to the asymptomatic group, more evident in performing the task without load, with statistically significant difference (p = 0,033) between groups for the right multifidus muscle. This study showed that individuals with nonspecific chronic low back pain have higher muscle activation before and after performing a functional task compared to healthy participants.

Keywords: chronic low back pain, functional task, lumbar muscles, muscle activity

Procedia PDF Downloads 178

Authors: Sayed-Mahdi Hashemi-Dehkordi, Ian Baker

Abstract:

This paper investigates the benefits of implementing distance learning in training courses for the oil and gas industries to reduce lean. Due to the remote locations of many oil and gas operations, scheduling and organizing in-person training classes for employees in these sectors is challenging. Furthermore, considering that employees often work in periodic shifts such as day, night, and resting periods, arranging in-class training courses requires significant time and transportation. To explore the effectiveness of distance learning compared to in-class learning, a set of questionnaires was administered to employees of a far on-shore refinery unit in Iran, where both in-class and distance classes were conducted. The survey results revealed that over 72% of the participants agreed that distance learning saved them a significant amount of time by rating it 4 to 5 points out of 5 on a Likert scale. Additionally, nearly 67% of the participants acknowledged that distance learning considerably reduced transportation requirements, while approximately 64% agreed that it helped in resolving scheduling issues. Introducing and encouraging the use of distance learning in the training environments of oil and gas industries can lead to notable time and transportation savings for employees, ultimately reducing lean in a positive manner.

Keywords: distance learning, in-class learning, lean, oil and gas, scheduling, time, training programs, transportation

Procedia PDF Downloads 52

Authors: Shilpa Sondkar, Maithili Patil, Atharva Potnis

Abstract:

The current health care landscape desires efficiency and patient satisfaction for optimal performance. Medical appointment booking apps have increased the overall efficiency of clinics, hospitals, and e-health marketplaces while simplifying processes. These apps allow patients to connect with doctors online. Not only are mobile doctor appointment apps a reliable and efficient solution, but they are also the future of clinical progression and a distinct new stage in the patient-doctor relationship. Compared to the usual queuing method, the web-based appointment system could significantly increase patients' satisfaction with registration and reduce total waiting time effectively.

Keywords: appointment, patient, scheduling, design and development, Figma

Procedia PDF Downloads 67

Authors: Zouhair Issa Ahmed, Ahmed Abdulrasool Ahmed, Falah Hassan Abdulsada

Abstract:

This paper presents a layout of a factory using Pro-Model simulation by choosing the best layout that gives the highest productivity and least work in process. The general problem is to find the best sequence in which jobs pass between the machines which are compatible with the technological constraints and optimal with respect to some performance criteria. The best simulation with Pro-Model program increased productivity and reduced work in process by balancing lines of production compared with the current layout of factory when productivity increased from 45 products to 180 products through 720 hours.

Keywords: scheduling, Pro-Model, simulation, balancing lines of production, layout planning, WIP

Procedia PDF Downloads 608

Authors: Mohsen S. Sajadieha, Danyar Molavia

Abstract:

In this paper, a truck scheduling problem is investigated at a two-touch cross-docking center with due dates for outbound trucks as a hard constraint. The objective is to minimize the total cost comprising penalty and delivery cost of delayed shipments. The sequence of unloading shipments is considered and is assumed that shipments are sent to shipping dock doors immediately after unloading and a First-In-First-Out (FIFO) policy is considered for loading the shipments. A mixed integer programming model is developed for the proposed model. Two meta-heuristic algorithms including genetic algorithm (GA) and variable neighborhood search (VNS) are developed to solve the problem in medium and large sized scales. The numerical results show that increase in due dates for outbound trucks has a crucial impact on the reduction of penalty costs of delayed shipments. In addition, by increase the due dates, the improvement in the objective function arises on average in comparison with the situation that the cross-dock is multi-touch and shipments are sent to shipping dock doors only after unloading the whole inbound truck.

Keywords: cross-docking, truck scheduling, fixed due date, door assignment

Procedia PDF Downloads 383

Authors: Abdulmohsen A. AlBesher, Richard T. Stone

Abstract:

Star rating for mobile applications is a very useful way to differentiate between the best and worst rated applications. However, the question is whether the rating reflects the level of usability or not. The aim of this paper is to find out if the user’ star ratings on mobile apps correlate with the usability of those apps. Thus, we tested three mobile apps, which have different star ratings: low, medium, and high. Participating in the study, 15 mobile phone users were asked to do one single task for each of the three tested apps. After each task, the participant evaluated the app by answering a survey based on the System Usability Scale (SUS). The results found that there is no major correlation between the star rating and the usability. However, it was found that the task completion time and the numbers of errors that may happen while completing the task were significantly correlated to the usability.

Keywords: mobile applications, SUS, star rating, usability

Procedia PDF Downloads 301

Authors: Wajiha Fatima

Abstract:

Various approaches and methods for second language classroom teaching have been proposed since the nineteenth century. Task Based Language Teaching has been prevailing approach in a second language classroom context. It is an approach which immerses students in a naturalistic setting. Tasks are the core unit of planning and instruction. This paper aims at expounding the concept of Task Based Language Teaching and how it has been evolved. In this study, researcher will highlight the usefulness of TBLT and the role it played as a powerful tool for learning and teaching in a second language setting. The article will reflect the implementation of various tasks based activities as well as the roles played by learners and teachers and the problems faced by them. In the end, researcher will discuss how TBLT can be implemented in second language classroom pedagogy.

Keywords: implementation, second language classroom, tasks, task based language teaching

Procedia PDF Downloads 326

Authors: J. Kaabi, Y. Harrath

Abstract:

This paper studied the flow shop scheduling problem under machine availability constraints. The machines are subject to flexible preventive maintenance activities. The nonresumable scenario for the jobs was considered. That is, when a job is interrupted by an unavailability period of a machine it should be restarted from the beginning. The objective is to minimize the total tardiness time for the jobs and the advance/tardiness for the maintenance activities. To solve the problem, a genetic algorithm was developed and successfully tested and validated on many problem instances. The computational results showed that the new genetic algorithm outperforms another earlier proposed algorithm.

Keywords: flow shop scheduling, genetic algorithm, maintenance, priority rules

Procedia PDF Downloads 452

Authors: Ali Allahverdi

Abstract:

The m-machine no-wait flowshop scheduling problem is addressed in this paper. The objective is to minimize total completion time subject to the constraint that the makespan value is not greater than a certain value. Setup times are treated as separate from processing times. Several recent algorithms are adapted and proposed for the problem. An extensive computational analysis has been conducted for the evaluation of the proposed algorithms. The computational analysis indicates that the best proposed algorithm performs significantly better than the earlier existing best algorithm.

Keywords: scheduling, no-wait flowshop, algorithm, setup times, total completion time, makespan

Procedia PDF Downloads 326