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).

The objective of this paper was to have a study on the perceptions of stakeholders of Public-Private Partnership (PPP) projects for factors affecting the attractiveness of road projects in India. A questionnaire survey was conducted among major PPP project participants of Indian PPP road projects. Fifteen attractive factors were shortlisted through a literature survey for designing the questionnaire. Collected data was analyzed with factor analysis and descriptive statistical analysis. The findings resulted in three components: effectiveness of the private sector, effective time and cost management, and the public sector’s economic benefit. Eight factors were identified as highly affecting the attractiveness of PPP in Indian road projects. PPP provides ample diversity of net benefits to both the public and private sectors. During the project development stage, both sectors have to formulate decisions based on appropriate assessment criteria. Therefore, the reflection of attractive factors will assist the public-sector to select PPP in the road sector. It also helps to establish the strategy for road projects using PPP.

In the project management, buffers are considered to handle uncertainties that lead to changes in project scheduling which in turn causes project delivery delay. The purpose of this survey is to discuss the state of the art on models and methods for project buffer management and time optimization of construction projects and manufacturing industries. There are not literally any surveys which review the literature of project buffer management and time optimization. This research adds to the previous literature surveys and focuses mainly on papers after 2014 but with a quick review on previous works. This research investigates the literature from project buffer sizing, project buffer consumption monitoring and project time/resource optimization perspectives.

Since scheduling literature has a wide range of uncertainties, it is crucial to take these into account when solving performance measure problems. Otherwise, the performance may severely be affected in a negative way. In this paper, an algorithm is proposed to minimize the total completion time (TCT) of a two-machine no-wait flowshop with uncertain setup times within lower and upper bounds. The results are compared to the best existing algorithm in scheduling literature: the programming language Python is used to generate random samples with respect to various distributions, and the TCT of the proposed algorithm is compared to that of the best existing one. Results reveal that the proposed one significantly outperforms the best one given in literature for all considered distributions. Specifically, the average percentage improvement of the proposed algorithm over the best existing one is over 90%. A test of hypothesis is conducted to further confirm the results.

This work aims to present the application of Multi-Criteria Decision-Making methods to the process of recruiting candidates for the position of project manager, considering aspects of the decision maker's preferences in uncertain and risk scenarios. Applied, descriptive and experimental, made up of the combined employment TODIM-FSE methods for multi-criteria classification of available candidates, and the method Behavioral TOPSIS, to choose the ideal project manager. The hybrid application of the Multi-Criteria Decision-Making methods TODIM-FSE, method based on Prospect Theory, and Behavioral TOPSIS, which considers the concept of loss aversion of Economic Behavior, is essentially innovative. When using TODIM-FSE and Behavioral TOPSIS, it was verified the explicit incorporation of the risk profile of the decision maker - aggressive, neutral, or conservative - in the context of aversion or propensity to the risks associated with the management of a project. Through the personal recruiting process from a large Brazilian organization, the possibility of adopting the hybrid model resulting from the combination of the two methods in a real situation was validated. Such validation allowed us to conclude that the candidates' classifications and choices, previously normally accepted, were at odds with the profile and risk propensity of the decision makers.

This study assessed the critical success factors (CSFs) of public-sector road construction projects execution from the perspective of definitive stakeholders associated with such projects by drawing on in-depth semi-structured interviews (16) and surveys (372) in Ghana, thirty-four (34) CSFs were identified. Using Relative Importance Index (RII), Spearman Rank Correlation Coefficients, and Kendall’s Coefficient of Concordance and the Chi-square test of significance statistics, the top ten most important factors in descending order are: the absence of political interference, project continuity by successive governments, adequate project funding, support from financial institutions and donor agencies and countries, government commitment to the project, absence of clientelism, absence of nepotism, no political corruption, payments of contractors on time and absence of court injunction or legal suit and land litigations. This study contributes to road construction CSFs in the context of public sector road construction in developing economies.