McMahon, G. B.
July 1969
CORS Journal;Jul69, Vol. 7 Issue 2, p141
Academic Journal
An approach to the flow-shop scheduling problem introduced by Dudek and Teuton has been modified by Smith and Dudek and by Bagga and Chakravarti. This paper presents a comprehensive theory for this approach and improves on the results obtained in these earlier papers. It also shows how the method could be extended and comments on the limitations of algorithms based on the "combinatorial analysis" approach.


Related Articles

  • ON THE EXACT UPPER BOUND FOR THE MULTIFIT PROCESSOR SCHEDULING ALGORITHM. Minyi Yue // Annals of Operations Research;1990, Vol. 24 Issue 1-4, p233 

    We consider the well-known problem of scheduling n independent tasks nonpreemptively on m identical processors with the aim of minimizing the makespan. Coffman, Garey and Johnson [1] described an algorithm, MULTIFTT, based on techniques from bin-packing, with better worst performance than the...

  • An iterative algorithm for scheduling unit-time tasks with precedence constraints to minimise the maximum lateness. Zinder, Yakov; Roper, Duncan // Annals of Operations Research;1998, Vol. 81 Issue 1-4, p321 

    We consider the maximum lateness problem in which all tasks have the same execution time and must be processed on m » 1 parallel identical processors subject to precedence constraints. All tasks and all processors are available at time t = 0, and each task has a due date. If all due dates are...

  • A RESOURCE ALLOCATION PROBLEM. Litsios, Socrates // Operations Research;Sep/Oct65, Vol. 13 Issue 5, p960 

    In this paper two sequencing problems are investigated that arise in the course of allocating one or more constrained resources to two or more tasks. The general problem considered is one of determining the optimal sequence of tasks and the optimal scheduling of resource usage where the...

  • Nonstrict vector summation in multi-operation scheduling. Sevastianov, Sergey // Annals of Operations Research;1998, Vol. 83 Issue 1-4, p179 

    We consider several multi-operation scheduling problems with m machines and n jobs, including flow shop, open shop, assembly line, and a few special cases of job shop with the minimum makespan criterion. It is demonstrated that the problems in question can be efficiently solved by approximation...

  • A permutation flow-shop scheduling problem with convex models of operation processing times. T. C. E. Cheng; A.Janiak // Annals of Operations Research;2000, Vol. 96 Issue 1-4, p39 

    The paper is an extension of the classical permutation flow-shop scheduling problem to the case where some of the job operation processing times are convex decreasing functions of the amounts of resources (e.g., financial outlay, energy, raw material) allocated to the operations (or machines on...

  • Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine. Tanaka, Keisuke; Vlach, Milan // Annals of Operations Research;1999, Vol. 86 Issue 1-4, p507 

    We investigate the problems of minimizing the maximum absolute lateness and range of lateness under generalized due dates on a single machine. In contrast to the traditional due date cases, we show that these problems are unary NP-hard. Furthermore, we present simple approximation algorithms for...

  • Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem. Panwalkar, S. S.; Smith, M. L.; Seidmann, A. // Operations Research;Mar/Apr82, Vol. 30 Issue 2, p391 

    We consider an n job, one machine scheduling problem in which all jobs have a common due date. The objective is to determine the optimal value of this due date and an optimal sequence to minimize a total penalty function. This penalty function is based on the due date value and on the earliness...

  • Optimal scheduling of tasks when service is subject to disruption: the preempt-repeat case. Glazebrook, Kevin D. // Mathematical Methods of Operations Research;2005, Vol. 61 Issue 1, p147 

    It has long been recognised that situations in which some key resource or service is to be allocated among jobs or customers competing for it are often subject to a range of uncertainties. Key amongst these concern the reliability of service itself. When the service being delivered to a job is...

  • A NEW ALGORITHM FOR THE QUASI-ASSIGNMENT PROBLEM. Tiantai Song; Li Zhou // Annals of Operations Research;1990, Vol. 24 Issue 1-4, p205 

    The quasi-assignment problem can be used to solve the bus scheduling problem, the tourist guide problem, and the minimum number of chains in a partially ordered set. A successive shortest path algorithm for the assignment problem is extended to the quasi-assignment problem. The algorithm is a...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics