The authors examined the relation between the availability of 2 popular types of flexible work arrangements (i.e., flextime and compressed workweek) and work-to-family enrichment and, in turn, the relation between work-to-family enrichment and (a) job satisfaction and (b) turnover intentions. In a sample of 220 employed working adults, hierarchical regression analyses showed that work-to-family...

Since that a job usually contains several working procedures in actual production, and it’s hard to optimize the flexible collaborative planning, the flexible lot splitting and scheduling of the job simultaneously in batch production mode, a model for multiobjective integration of flexible collaborative planning and fuzzy lot-splitting scheduling is established. We take four performance indicat...

The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The problem is to assign operations to machines and to order the operations on the machines so that the operations can be processed in the smallest amount of time. This models a wide variety of problems encountered in real ...

In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...

Purpose To investigate the efficiency of a discretization procedure utilizing a time-indexed mathematical optimization model for finding accurate solutions to flexible job shop scheduling problems considering objectives comprising makespan and tardiness, respectively. Design/methodology/approach A time-indexed mixed integer programming model is used to find solutions by iteratively employing ti...

When faced with a multiobjective optimization problem, it is necessary to consider the decision-maker preferences in order propose best compromise solution. We flexible job shop scheduling problem and that represented using non-compensatory reference level-based preference model. show how integrating this model into genetic algorithm allows obtain solutions surpass more aspiration levels when c...