Showing papers on "Flow shop scheduling published in 1971"

Scheduling with earliest start and due date constraints

Abstract: We consider the scheduling of n tasks on a single resource. Each task becomes available for processing at time a i , must be completed by time b i , and requires d i time units for processing. The aim is to find a schedule that minimizes the elapsed time to complete all jobs. We present solution algorithms for this problem when job splitting is permitted and when job splitting is not permitted. Then we consider several scheduling situations which arise in practice where these models may apply.

Optimality Criteria for Flowshop Schedules

Abstract: This article considers the problem of scheduling n jobs on M machines in a flowshop and examines the present formulation of the problem. To understand the true nature of the problem, this article provides economic interpretations of various optimality criteria which are being used for solving the scheduling problem. A general optimization criterion, called minimization of opportunity cost, is proposed for flow-shop scheduling problems and the results of the sensitivity analysis of various optimality criteria are reported which indicate the need to reformulate the scheduling problem.

General scheduling algorithms with applications to parallel scheduling and multiprogramming scheduling

Abstract: Branch-and-bound algorithms are presented on related disjunctive graph for general job-shop scheduling problems with various objective functions for two cases, such that set-up times are included in process­ ing times in one case and not in the other case. They are applied to parallel scheduling and multiprogramming of programs and/or multi­ project sheduling.

A Precedence Graph Algorithm for the Shop Scheduling Problem

Abstract: This paper is concerned with the development of a precedence graph algorithm for solving certain combinatorial problems. This algorithm is applied mainly to job-shop scheduling problems; however, the extension of its applicability can be demonstrated by considering project scheduling, travelling salesman and explosion problems. The algorithm employs linear graphs to construct the quantified precedence matrix, a powerful criterion to resolve the conflict between the tied operations, and the use of a quasi-Boolean procedure to evaluate the obtained sequence.

Development of scheduling strategies in the TITAN operating system

Abstract: Scheduling strategies are evolved to solve problems of selection in operating systems. Such strategies frequently undergo evolution in time as details of the specification are changed or, more frequently, as inadequacies in them are shown up by use in a heavily loaded system. This paper describes a number of scheduling strategies used in the TITAN system, and their development to meet changing circumstances or to overcome inadequacies.

Integrated circuit shop simulation for capacity planning and scheduling

Abstract: A large flow shop with cycling has been modeled with GASP II in an effort to study the effects of scheduling rules and capacity constraints. Consisting of multiple codes requiring 150-175 operations on 55 facilities, the shop, an integrated circuit line, was previously simulated in Fortran IV for the express purpose of determining the frequency of input messages to a shop information system. However, the Fortran IV model did not possess enough flexibility or efficiency for doing further analysis. By utilizing GASP II and its list processing techniques, shorter running times and implementations of scheduling algorithms could be achieved in a compact manner. The GASP II model is also capable of handling rework loops, yield distributions for each facility, priority assignments, and multiple channels per facility. Ultimately the model will have application for production scheduling in an on-line, real-time shop information system.

A New Approach to Job Shop Scheduling with Due Dates

Abstract: : The classical formulation of the static job shop scheduling problem with job due dates implies that the question of interest to the manager is: What is the best that can be done to meet due dates with fixed resources. In this paper, two alternative formulations of the problem are proposed; one because of its practical appeal, the other because of its methodological appeal. The latter is used to develop a multi-pass heuristic scheduling procedure aimed at providing a practical tool for attacking any of the three formulations of the problem. The procedure was programmed and applied to a set of nineteen test problems for which solutions satisfying all job due dates are known to exist. The problems range in size up to 10 jobs, 9 machines and 14 jobs, 7 machines. Solutions were attained for each of the test problems. The average and maximum IBM 360-91 computing times were 1.23 and 3.28 seconds, respectively. (Author)

Labor Assignment in Single Server, Two-Machine Flow Shop with Switching Times

Abstract: Algorithms have been presented in the literature to find the optimal sequencing of jobs for a two-machine flow shop. We extend the results to a labor limited situation where only a single server is available and switching times are involved in moving the worker from one machine to the other. We present the theoretical results needed for the development of the algorithm, the algorithm, and an example problem solved using the algorithm.

Priority scheduling rules for a combined production-inventory system: A simulation analysis

Abstract: One proposal for improving the combined performance of a shop and its associated inventory system is to incorporate inventory information into priority scheduling rules. This paper describes several ways that inventory information can be used for scheduling purposes. It also reports the results of simulation experiments that were conducted to evaluate the gain in performance resulting from the inclusion of inventory data in scheduling rules. The results of these experiments indicate that in designing scheduling rules, an increase in the amount and availability of inventory data is far less important in improving manufacturing performance than the application of a modest amount of inventory theory.