This paper aims to study a real case of an optimization problem derived from hospital supply chain. The present work focuses on developing operational decision support models and algorithms for production process scheduling in catering. addressed system is considered as flexible job shop system. objective minimize the total flow time. A novel mathematical model two metaheuristics multi-product ...

Although flexible working practices (FWPs) have been associated with positive individual outcomes, less is known about ‘how’ and ‘why’ such associations occur. Drawing on Conservation of Resources theory, this study examines the mediating moderating processes which underpin relationship between FWPs job-related anxiety. The study’s hypotheses, proposing a moderated mediation model, are tested u...

Background: Flexible work schedules give nurses the freedom and control to manage demands of work and life, while allowing the organisation to meet their staffing needs. Aim: To explore nurses’ perceptions of their job satisfaction and its relationship to selfscheduling. Significant to Nursing Practice and Leadership: Nurses and nurse leaders have the potential to change the way scheduling of t...

S ince at least the late 1970s, ‘‘flexible production’’ has commonly been considered as a positive and necessary innovation to ensure sustainable economic growth. 2 The need to be ‘‘flexible’’ has been proposed for workplace technical systems, schedules and salaries, and ‘‘flexibility’’ has even been recognised as a positive feature of a worker’s personality. Increasing labour flexibility means...

Job-shop scheduling problem is one of the most important fields in manufacturing optimization where a set of n jobs must be processed on a set of m specified machines. Each job consists of a specific set of operations, which have to be processed according to a given order. The Flexible Job Shop problem (FJSP) is a generalization of the above-mentioned problem, where each operation can be proces...

Flexible job-shop scheduling problem (FJSP) has been well known as one of the most difficult NP-hard combinatorial optimization problems. This problem FJSP is an extension of job-shop scheduling problem (JSP) which is to create a sequence of operations satisfying the precedence relationship together with assignment of time and resources for each operation. Thus, the FJSP model is closer to the ...