This study explores the relationship between job satisfaction, employee loyalty and two types of flexible employment arrangements; teleworking and flexi-time. The analysis relies on data derived by the Workplace Employee Relations Survey (WERS) in 2004 and 2011. A propensity score matching and least squares regressions are applied. Furthermore, Bayesian Networks (BN) and Directed Acyclic Graphs...

Flexibility in job shop scheduling is a main problem that has been considered by many of researchers in recent years.So Scheduling for the flexible job shop is very important in the field of production management and combinatorial optimization. However, it is quite difficult to achieve an optimal solution to this problem in medium and actual size problems with traditional optimization approache...

To accomplish both, the demand of the users of parallel systems for a low response time and the ambition of the system maintainers for a high utilization, is hard to do. A high utilization normally results in long waiting times for the users’ jobs. An alternative to the standard jobs with fixed width are more flexible jobs models. They allow to change the job’s width at application start (molda...

Flexible job shop scheduling problem (FJSP) is an important extension of the classical job shop scheduling problem, where the same operation could be processed on more than one machine. A Variable Neighborhood Genetic Algorithm (VNGA) is proposed for the problem with makespan criterion, consisting of a combination of the variable neighborhood search (VNS) and genetic algorithm (GA). Variable ne...

This research deals with a flexible flowshop scheduling problem with arrival and delivery of jobs in groups and processing them individually. Due to the special characteristics of each job, only a subset of machines in each stage is eligible to process that job. The objective function deals with minimization of sum of the completion time of groups on one hand and minimization of sum of the diff...