Recessionary changes at work and employee well-being: The protective roles of national and workplace institutions

The recession following the 2008 financial crisis brought major changes to employees’ experiences at work. We investigate the adverse effects of two of such changes: perceived organizational distress and job deterioration. We also examine the extent to which institutions at national level (employment protection legislation and collective bargaining coverage) and at workplace level (employment contract and union membership) may act as buffers against these effects. Using data from 21 European countries, we show that recessionary changes were associated with reduced psychological well-being and greater levels of work–nonwork interference.

Fuzzy Parallel Machine Scheduling Problem Under Fuzzy Job Deterioration and Learning Effects With Fuzzy Processing Times

This chapter presents a mixed integer non-linear programming (MINLP) model for a fuzzy parallel machine scheduling problem under fuzzy job deterioration and learning effects with fuzzy processing times in order to minimize fuzzy makespan. The uncertainty of parameters such as learning/deterioration effects and processing times in a scheduling problem makes the solution of the problem uncertain. Fuzzy sets can be used to encode uncertainty in parameters. In this chapter, possibilistic distributions of fuzzy parameters and possibilistic linear programming approaches are used in order to create a solution method for MINLP model of fuzzy parallel machine scheduling problem.

Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration

The [Formula: see text]-job and [Formula: see text]-machine permutation flow shop scheduling problem with a proportional deterioration is considered in which all machines process the jobs in the same order, i.e., a permutation schedule. A proportional deterioration means that the job deterioration as an increasing function that is proportional to a linear function of time. The objective is to minimize the makespan, i.e., the maximum completion time. When some dominant relationships between [Formula: see text] machines can be satisfied, we show that some special cases of the problem can be polynomial solvable. For the general case, we also propose a heuristic algorithm and give the computational experiments.

MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS

In this study, we consider a permutation flow shop scheduling problem on a three-machine with deteriorating jobs (a deteriorating job means that the job's processing time is an increasing function of its starting time) so as to minimize the makespan. We model job deterioration as a function that is proportional to a linear function of time. For some special cases, we prove that the problem can be solved in polynomial time. We develop branch-and-bound and heuristic procedures for the general case. Computational experiments for the branch-and-bound algorithm and heuristic algorithm are presented.