Abstract Quantum Annealing (QA) is a metaheuristic for solving optimization problems in time-efficient manner. Therefore, quantum mechanical effects are used to compute and evaluate many possible solutions of an problem simultaneously. Recent studies have shown the potential QA such complex assignment within milliseconds. This also applies field job shop scheduling, where existing approaches ho...

We study a scheduling problem in which jobs may be split into parts, where the parts of a split job may be processed simultaneously on more than one machine. Each part of a job requires a setup time, however, on the machine where the job part is processed. During setup, a machine cannot process or set up any other job. We concentrate on the basic case in which setup times are job-, machineand s...

BACKGROUND It has been suggested that individual job characteristics have a significant impact on job burnout, and the process is subject to the regulation of demographic variables. However, the influence path of job characteristics on job burnout is still a "black box". SUBJECTS AND METHODS On the basis of a systematic literature review by employing Pub Med, Science Direct, Web of Science, G...

Job-shop scheduling is an important but difficult problem arising in low-volume high-variety manufacturing. It usually solved at the beginning of each shift with strict computational time requirements. To obtain near-optimal solutions quantifiable quality within limits, a direction to formulate them Integer Linear Programming (ILP) form so as take advantages widely available ILP methods such Br...