Skip to main content
SpringerLink
Log in

A Method for Single Facility Multiple Products Scheduling

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

Abstract

The single facility multiple products scheduling problem is formulated into a multiperiod mathematical programming model with zero-one variables. An algorithm to solve the scheduling problem by using the concept of state vectors of dynamic programming is described. An example of application of the model and the algorithm is also presented. It has been found that a suitable selection of a state vector reduces greatly the dimensionality of the problem

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, University of Singapore,

    H. Paul & S. S. Law

  2. Esso (Singapore) Pte Ltd, Singapore

    H. K. Leong

Authors
  1. H. Paul
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. S. Law
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. K. Leong
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Paul, H., Law, S. & Leong, H. A Method for Single Facility Multiple Products Scheduling. J Oper Res Soc 31, 825–832 (1980). https://doi.org/10.1057/jors.1980.149

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.1980.149

Search

Navigation