A scheduling system is proposed and developed for a special type of flow shop. In this flow shop there is one machine at each stage. A job may require multiple operations at each stage. The first operation of a job on stage j cannot start until the last operation of the job on stage j-1 has finished. Preemption of the operations of a job is not allowed. The flow shop that we consider has anothe...

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...

In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...

In this paper, the barriers to re-employment for unemployed job seekers are studied by means of duration models. The determinants included in the duration models are derived from an economie model of the different stages in the job search process. The empirical analysis of unemployment duration is based on both a reduced form and a structural approach. The reduced form model used is a propottio...

[Purpose] We investigated the physical condition of middle-aged workers in Korea by job category (office job vs. production job). [Subjects] In total, 3,650 middle-aged workers (production job, n = 2,615; office job, n = 1,035) ≥50 years of age from eight geographical areas were evaluated from 2007 to 2008. [Methods] The subjects' subjective physical condition, exercise status, smoking status, ...

Jobs to be processed in distributed systems are often characterized by a high complexity. Several interdependent tasks (here called "steps") have to be performed on possibly different sites using different types of resources (services) [1,2,5-7]. As an example, think of a print job (job type J1) submitted by a user to be printed on some special printer. This print job consists of a database acc...