This research introduces three heuristic algorithms for solving job-shop scheduling problems, job-shop scheduling problems with multi-purpose machines, and open-shop scheduling problems. All these algorithms are based on the particle swarm optimization algorithm, and generate solutions that belong to the class of parameterized active schedules via their specific decoding procedures. Comparison ...

OBJECTIVES The aim of the study was to investigate the direct and indirect - mediated by job burnout - effects of job demands on mental and physical health problems. The Job Demands-Resources model was the theoretical framework of the study. Three job demands were taken into account - interpersonal conflicts at work, organizational constraints and workload. Indicators of mental and physical hea...

We consider two single-machine group scheduling problems with deteriorating group setup and job processing times. That is, the job processing times and group setup times are linearly increasing or decreasing functions of their starting times. Jobs in each group have the same deteriorating rate. The objective of scheduling problems is to minimize the sum of completion times. We show that the sum...

This paper addresses the minimization of the mean absolute deviation from a common due date in a two-machine flowshop scheduling problem. Initially, a job scheduling algorithm that obtains an optimal schedule for a given job sequence is presented. This algorithm is used with a job insertion procedure to generate a group of heuristics that differ on the initial job sequencing rule. Computational...

According to recent research, stable dispositional factors may result in considerable consistency in attitudes such as job satisfaction across time and situations. If true, this finding may have important implications. For example, Staw and Ross (1985) argued that "many situational changes such as job redesign . . . may not affect individuals as intended." Such personnel programs "may be prone ...

A variety of Genetic Algorithms for the static Job Shop Scheduling Problem have been developed using various methods: direct vs. indirect representations, pure vs. hybrid GA's and serial vs. parallel GA's. We implement a hybrid GA, called OBGT, for solving the static Job Shop Scheduling Problem. A chromosome representation containing the schedule itself is used and order-based crossover operato...