Airport Collaborative Decision Making (ACDM) flight scheduling plans rely on accurate predictions of both optimal and reliable aircraft turnaround times, which is one of the most difficult things to complete. In order to account for the effects of randomness and fuzziness on the turnaround process duration, this paper deals with transforming the probability distribution of well-fitted sub-processes into a cumulative density function, which is equivalent to the fuzzy membership function (FMF), and then using goodness-of-fit to determine the fuzzy membership grade of each turnaround sub-process. The turnaround time is calculated using the fuzzy critical path method (FCPM), which is a combination of the Critical Path Method (CPM) and fuzzy set theory. In order to verify this estimate, we created the FMF using historical data and compared it to turnaround times based on FCPM. A linear regression model is used to examine the relationship between arrival delays and the FCPM-based turnaround process. We also use historical data to generate fuzzy sets of different arrival delays using Frankfurt airport data from the summer of 2017 and conclude that delays are positively correlated with the FCPM-based turnaround process.

Scheduling plays an important role in service and manufacturing environments for the delivery of reliable products on time. The scheduling literature reveals that the vast majority of the investigated scheduling problems are for the deterministic case where all parameters of jobs are known in advance and are fixed. However, in some real-world environments, the assumption of fixed parameters of jobs is not valid since job parameters are uncertain. An uncertain parameter can be modelled as having a probability distribution, or it can be modelled as a fuzzy number, or it can be modelled as a random variable within some interval with lower and upper bounds, distribution free. If the uncertain parameter, e.g., processing time, is modelled as a random variable within some lower or upper bounds, it is called interval or bounded processing time. The objective of this paper is to survey the investigated scheduling problems with interval or bounded processing/setup times. The scheduling literature is reviewed, the addressed problems are analyzed, and classified based on shop environments (single machine, parallel machine, flowshop, job shop), performance measures, the approach taken in the papers to solve the considered problem, and interval/bounded processing times or setup times. Some future research opportunities with interval/bounded processing/setup times are presented.

Across the globe, the corollary of Green Cost Premium (GCP) obstructs the implementation of Sustainable Buildings (SB). Extensive studies into GCP proliferate, but the research norms rarely traversed theoretical contexts of GCP. The purpose of this paper was to explore the drivers of GCP from the contexts of the prevailing practice of SB using the theoretical lens of practice theory. Secondary literature comprising mainly peer-reviewed publications spanning 20years was critically reviewed. The results show some uncertainty regarding the effect of prevailing practice on the size of GCP due to the dearth of empirical studies. Secondary literature, however, showed that GCP is liable to variations in practice related to the level of knowledge and the implementation processes. The knowledge domain argued that the scope of GCP depends on regional issues including misperceptions, cost management deficiencies and sustainability accounting gaps. During implementation, GCP could also modify in response to changes in cost drivers, factors limiting innovative processes and challenges and barriers in the project environment. Engagements with practice have, however failed to embed this understanding into SB project implementation decisions and dynamics, as limited documented efforts aimed at mitigating the GCP exist. The paper offers a non-conventional perspective for assessing the dynamics of converging regional practices in SB that can contribute to GCP as well as lower the GCP when the practices are improved. GCP is susceptible to practice variations and answers to projects practices across regions. This portrays that the GCP can lessen through innovation of practice elements such as competencies and inputs (materials and procedures). The elements of scientific inquiry for GCP must be disconnected from currently established knowledge about SB systems to regional practices related to knowledge and procedures.

Education is the future. Education is the only way for a country to start developing and reducing poverty. In countries with medium incomes like Peru, the resources to spend on education is not unlimited. Therefore, it is necessary to have quality in investment. However, risks and uncertainty can make a project surpass its initial budget. Therefore, statistic based methods like Monte Carlo simulation is a powerful tool to forecast possible events that might endanger the profitability and sustainability of a project. Although there is not plenty of academic literature about Monte Carlo empirical usage, many projects employ this method to manage the possible risks the project could have. In consequence, the current research analyzed both risk and sensitivity of an elementary school building project. Both analyses showed that this project had huge probabilities to surpass the current profit and return estimations. However, the sensitivity analysis portrayed that the project could be endangered because of infrastructure overspending. Moreover, it indicated that students’ attendance is also a critical factor to ensure the sustainability of the project.

The integration between production and distribution to minimize total elapsed time is an important issue for industries that produce products with a short lifespan. However, the literature focus on production environments with a single stage. This paper enhances the complexity of the production system of an integrated production and distribution system by considering flowshop environment decisions integrated with a vehicle routing problem decision. In this case, each order is produced in a permutation flowshop subsystem and then shipped to its destination by a capacitated vehicle, and the objective is to sequence these orders to minimize the makespan of the schedule. This paper uses two approaches to address this integrated problem: a mixed-integer formulation and an Iterated Greedy algorithm. The experimentation shows that the Iterated Greedy algorithm yields results with a 0.02% deviation from the optimal for problems with five jobs, and is a viable option to be used in practical cases due to its short computational time.

We investigated a variant of the customer order scheduling problem taking into consideration due dates to minimize the total tardiness. Since the problem under study is NP-hard, we propose an efficient size reduction algorithm (SR). We perform an extensive computational experience and compare our proposition with JPO-20 matheuristic, the best existing algorithm for the problem under study. We use the Relative Deviation Index (RDI) and the Success Rate (SRa) as the statistical indicators for the performance measure. We must emphasize that SR presented the lowest average RDI (around 15.5 %), whereas the JPO-20 presented an average RDI approximately three times higher (around 52.5 %). Furthermore, the proposed SR presented a higher average SRa (around 66.9%), whereas the JPO-20 presented a lower average success (around 25.7%). Our proposal used a lower computational effort, resulting in a reduction for the computation times of approximately 22%. The obtained results point to the superiority of the proposed SR in comparison with the JPO-20.

The no-wait flow shop scheduling problem (NWFSP) plays a crucial role in the allocation of resources in multitudinous industries, including the steel, pharmaceutical, chemical, plastic, electronic, and food processing industries. The NWFSP consists of n jobs that must be processed in m machines in series, and no job is allowed to wait between consecutive operations. This project deals with NWFSP with sequence-dependent setup times for minimizing earliness and tardiness. From the literature review of the last five years in NWFSP, it is noticeable that only around 1.92% of the researchers have studied that multi-objective function, which could help to improve the productivity of industries where methods such as just in time are considered. Besides, there is no information about previous researchers that have solved this problem with sequence-dependent setup times. Firstly, a MILP model is proposed to solve small instances, and secondly, a genetic algorithm (GA) is developed as a solution method for medium and large instances. Compared with the mathematical model for small instances, the GA obtained the optimal solution in 100% of the cases. For medium and large instances, the GA improves in an average of 31.54%, 38.09%, 44.58%, 47.72%, and 37.33% the MDD, EDDP, ATC, SPT, and LPT dispatching rules, respectively.

Poverty is one of the significant problems, and almost all countries worldwide face poverty issues that negatively impact society. This study is written to investigate the students' knowledge and awareness of poverty and interest level in conducting e-business and garage sales. Also, examine the relationship of knowledge and awareness on students' intention to conduct e-business and garage sales. There were 152 respondents from the same university who participated in this study. The data analyzed using descriptive and inferential statistics performed by SPSS-23 and SmartPLS 3.3.3. The survey showed that the student's knowledge and awareness of poverty are still lacking and need improvement. Half of the respondents said they are not familiar with SDG1, and they were not aware that their university has done an event related to SDG1 and poverty. There were 25% and 85% of students interested in conducting e-business and garage sales that increased their pocket money and reduced poverty rates among university students. Overall, this study's result shows a positive response from all respondents, and most of them have general ideas of poverty. In addition, this study has identified that the variable knowledge and awareness have a significant positive effect on student's intention to conduct e-business and garage sales.

In this paper, a new hybrid AHP and Dempster-Shafer Theory of Evidence is presented for solving the problem of choosing the best project among a list of available alternatives while uncertain risk factors are taken into account. The aim is to minimize overall risks. For this purpose, four groups of risk factors, including Properties, Operational and Technological, Financial, Strategic risk factors, are considered. Then using an L24 Taguchi method, several experiments with various dimensions have been designed and solved by the proposed algorithm. The outcomes are then analyzed using the Validating Index (VI), Reduced Risk Indicator (R.R.I%), and Solving time. The findings indicated that, compared to the classic AHP, the results of the proposed hybrid method were different in most cases due to uncertainty of risk factors. It was observed that the method could be safely used for selecting project problems in real industries.

This paper is concerned with an overview of the Resource-Constrained Project Scheduling Problem (RCPSP) and the conventional meta-heuristic solution techniques that have attracted the attention of many researchers in the field. Therefore, researchers have developed algorithms and methods to solve the problem. This paper addresses the single-mode RCPSP where the objective is to optimize and minimize the project duration while the quantities of resources are constrained during the project execution. In this problem, resource constraints and precedence relationships between activities are known to be the most important constraints for project scheduling. In this context, the standard RCPSP is presented. Then, the classifications of the collected papers according to the year of publication and the different meta-heuristic approaches applied are presented. Five weighted articles and their meta-heuristic techniques developed for RCPSP are described in detail and their results are summarized in the corresponding tables. In addition, researchers have developed various conventional meta-heuristic algorithms such as genetic algorithms, particle swarm optimization, ant colony optimization, bee colony optimization, simulated annealing, evolutionary algorithms, and so on. It is stated that genetic algorithms are more popular among researchers than other meta-heuristics. For this reason, the various conventional meta-heuristics and their corresponding articles are also presented to give an overview of the conventional meta-heuristic optimizing techniques. Finally, the challenges of the conventional meta-heuristics are explored, which may be helpful for future studies to apply new suitable techniques to solve the Resource-Constrained Project Scheduling Problem (RCPSP).