This chapter presents a novel, mixed-integer programming model of the flexible flow line problem that minimizes the makespan of a product. The proposed model considers two main constraints, namely blocking processors and sequence-dependent setup time between jobs. We extend two previous studies conducted by Kurz and Askin (2004) and Sawik (2001), which considered only one of the foregoing const...

Flexible work schedules give nurses the freedom and control to manage the demands of work and home, allow organisations to meet their staffing needs and can improve job satisfaction. This article reports the results of an integrative review of published peer-reviewed research and personal narratives that examined nurses' perceptions of the relationship between job satisfaction and a self-schedu...

  In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...

In recent years, many employees have gained more control over temporal and locational aspects of their work via a variety of flexible work arrangements, such as flexi-time and telehomework. This temporal and locational flexibility of work (TLF) is often seen as a means to facilitate the combination of work and private life. As such it has been recommended as a policy to increase the average num...

Flexible Job Shop Problem (FJSP) is an extension of classical Job Shop Problem (JSP). The FJSP extends the routing flexibility of the JSP, i.e assigning machine to an operation. Thus it makes it more difficult than the JSP. In this study, Cooperative Coevolutionary Genetic Algorithm (CCGA) is presented to solve the FJSP. Makespan (time needed to complete all jobs) is used as the performance eva...

In the classical job shop scheduling problem (JSSP), n jobs are processed to completion on m unrelated machines. Each job requires processing on each machine exactly once. For each job, technology constraints specify a complete, distinct routing which is fixed and known in advance. Processing times are sequence-independent, fixed, and known in advance. Each machine is continuously available fro...