A fast finite loading algorithm for job oriented scheduling

Chung‐Hsing Yeh

doi:10.1016/S0305-0548(96)00035-4

Return

A fast finite loading algorithm for job oriented scheduling

1997-02-01

PRE

Chung‐Hsing Yeh *

DOI：10.1016/S0305-0548(96)00035-4

Original

Original request for help

Save

Abstract

En 中文

Job oriented scheduling (JOS) has been the most commonly used technique in actual job shop settings. It loads jobs one by one onto machines, in which all the operations of a job are scheduled in succession. This article presents a JOS model and formulates a fast finite loading procedure which is the key algorithm of computer-based JOS systems. The algorithm assigns feasible schedule start and finish times to the operations of a job by loading them forward or backward onto the capacity constrained parallel machines. A particular technique is the maintenance of blocks of consecutively scheduled operations on each machine, thereby reducing the search time for finding a feasible time slot for each operation on the corresponding machine. Experimental testing shows that the algorithm has significant computational performance for large size problems. Copyright (C) 1997 Elsevier Science Ltd

Keywords:

RULES

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.