Just-in-time scheduling. Models and algorithms for computer and manufacturing systems (Q2644259): Difference between revisions

More than 50 years ago, just-in-time production was introduced by the Japanese car manufacturer Toyota and, subsequently, Toyota became the most successful car manufacturer of the world. Despite the title, the book deals not in the first instance with just-in-time production, but with the algorithms used to solve the corresponding optimization problems. In the first chapter the problem of just-in-time production is described for manufacturing processes and computer systems, which have to work in real time. The advantages are listed and the difficulties outlined. Just-in-time is the result of an optimal scheduling under side conditions. The given due dates constitute the side conditions, while different functions of earliness and tardiness are used as optimality criterion. The second chapter contains the methodology used in deterministic scheduling theory. Actually, the book deals only with deterministic situations and does not cover random variations of the production times. The general problem is formulated using the approach developed in the theory of apportionment, which also yields a number of interesting properties. The next two chapters investigate special cases with respect to the nature of the due dates (common and individual), cost functions (linear and quadratic), schedules with idle times and without idle times and, in particular, with respect to the objective function. Finally, in the fifth and last chapter algorithms are introduced to balance schedules, i.e., the optimal order of products on the assembly line makes sure that the variation of the production volume at the manufacturing level is minimized. At first, the problem is formulated for the general case of a multi-level production process and, subsequently, the special case of a single-level process is considered, which leads to the so-called product rate variation problem (PRV). In each case different optimality criteria are considered. The connection between the PRV problem and the corresponding apportionment problem is discussed and, in the end, the case of scheduling periodic tasks is briefly dealt with.