Showing papers on "Flow shop scheduling published in 1970"

A Branch-and-Bound Algorithm for Flow Shop Scheduling Problems

Abstract: This article is concerned with the solution of the flow shop scheduling problem in which all jobs have the same machine ordering. A branch-and-bound algorithm is developed for finding the sequence of J jobs to be processed on M machines which minimizes the schedule time. Thib algorithm consists of branching and bounding processes, but without the backtracking process which guarantees optimality. The procedure employed is that in constructing a subset of feasible sequences, a node representing a partial sequence is branched. Selection of the node depends on the lower-bound concept as a decision rule. This lower bound is based on resolving the conflict of jobs on the last machine. By using this algorithm, the number of explored nodes is considerably reduced and, hence, the computational effort involved in obtaining an optimal or near-optimal solution is decreased. High quality of solutions is obtained. Computationally, this algorithm extends the size of problems that can reasonably be solved.

Letter to the Editor—An Experimental Investigation and Comparative Evaluation of Flow-Shop Scheduling Techniques

Abstract: This note is concerned with the solution of the flow-shop scheduling problem where all jobs have the same machine ordering. Because of the combinatorial nature of this problem, most practical situations remain unsolved. Various techniques such as switch and check, branch and bound with and without backtracking, modified decomposition, and rounded linear programming have been proposed by several investigators. However, no comparative evaluation of these procedures has been previously made. This note investigates the solutions obtained by these procedures considering both the quality of the solutions and the computational efficiency. Extensive experimentation has been conducted and significant results are reported. The effects of changes in the size of problems on the above criteria are also included.

A Production Scheduling Model by Bivalent Linear Programming

Abstract: The paper focuses on multi-stage production systems. If such a system is of the more general type than a production line and many products have to be manufactured according to different technological sequence restrictions then two problems arise: (1) scheduling and (2) sequencing. The formulation of that problem requires the simultaneous consideration of the scheduling and sequencing aspect. The paper integrates these two functions into one single model using zero-one programming.

A Branch-and-Bound Algorithm for the Continuous-Process Job-Shop Scheduling Problem

Abstract: The continuous-process job-shop scheduling problem (CPJS) arises typically in the following way: (1) a set of M machines or production facilities are available; (2) a set of N jobs are to be processed through these machines in accordance with a technological matrix; (3) the machines associated with a given job must all be used simultaneously for the completion of this job; (4) a predetermined production time is required for each job; (5) the objective is to determine a production schedule which minimizes the total completion time (makespan) of all jobs A branch-and-bound type algorithm for the solution of the (CPJS) problem is presented

How To Schedule A Flow Shop Plant By Agents

Abstract: The flow shop scheduling problem consists, according to a certain number of criteria, in finding the best possible allocation of n jobs on m resources, so that operations of every job must be processed on all resources in a unique order. Because of its highly combinatorial aspect, this scheduling procedure has been widely studied in the literature by exact and mostly heuristic methods. The approach, we adopt here to deal with this problem, combines a Multi-Agent system with a stochastic combinatorial optimization tool, the simulated annealing. This paper stresses the efficiency and the optimality of a distributed implementation of this tool compared to a classical one.

B70-4 Theory of Scheduling

Abstract: Scheduling and resource allocation have come to the forefront of the problems that confront the designers of computer systems. This is particularly true in time-sharing, multiprogramming, and real-time systems, but it is also the case for somewhat less sophisticated systems due to problems created by disk accessing. Theory of Scheduling is a very readable treatment of some of the "classical" solutions to scheduling problems, as well as some heuristic ad hoc approaches that are suitable in particular computer environments. The operating systems designer should not consider this book as the panacea for all of his ills, however, because the methodology that is given for solving his scheduling problems may be unsatisfactory in the context in which he chooses to use it. For example, in a real-time system the scheduling algorithm must satisfy constraints on maximum computation time which are not necessarily satisfied by the algorithms described in the text.

Physical Planning of a Glass Plant Process Control Computer Installation

Abstract: A strong foundation for the successful implementation of a process control computer system is the result of careful and thorough planning of all physical equipment in the early stages of the project. This was accomplished during installation of the existing float glass process control systems at both the Nashville and Dearborn glass plants of Ford Motor Company.

Job shop scheduling simulations for interactive use in computer graphics

Abstract: A discussion of an interactive computer graphics system used for job shop scheduling problems, with emphasis on the structure of the job shop simulator schedule generator. Three different language implementations are discussed in light of the special requirements of this application.

Device photolithography: The mask shop information system

Abstract: The Mask Shop Information System (MSIS) is a set of computer tasks which exist in a specially designed multi-programming environment within a PDP-9 computer, and which control the flow of jobs through the new mask-making facility. The main functions of MSIS are to accept job descriptions and to assign tasks and pass data to the various shop facilities so that these jobs can be efficiently processed. In addition, MSIS keeps statistics on the progress and problems of the shop and issues reports both periodically and upon demand.

A Case-based Expert System For SchedulingProblems With Sequence Dependent Set Up Times

Abstract: Scheduling is an important application area for expert systems. However, the development of expert systems in scheduling poses many problems and many different approaches have been attempted in prototype systems. This paper discusses the use of case-based reasoning (CBR) in the development of expert scheduling systems. The design and development of an expert system using CBR is described. The application area is an important class of scheduling problems those involving sequence dependent set up times. This type of problem is important in many production environments and arises frequently in the process industries. The paper addresses general problems and research issues related to the application of CBR to scheduling problems.

The scheduling of n tasks with m operations on two processors

Abstract: The job shop problem is one scheduling problem for which no efficient algorithm exists. That is, no algorithm is known in which the number of computational steps grow algebraically as the problem enlarges. This paper presents a discussion of the problem of scheduling N tasks on two processors when each task consists of three operations. The operations of each task must be performed in order and among the processors. We analyze this problem through four sub-problems. Johnson''s scheduling algorithm is generalized to solve two of these sub-problems, and functional equation algorithms are used to solve the remaining two problems. Except for one case, the algorithms are efficient. The exceptional case has been labelled the "core" problem and the difficulties are described.