Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem

J. Erschler, F. Roubellat and J. P. Vernhes
Additional contact information
J. Erschler: Laboratoire d'Automatique et d'Analyse des Systémes du C. N. R. S., Toulouse, France
F. Roubellat: Laboratoire d'Automatique et d'Analyse des Systémes du C. N. R. S., Toulouse, France
J. P. Vernhes: Laboratoire d'Automatique et d'Analyse des Systémes du C. N. R. S., Toulouse, France

Operations Research, 1976, vol. 24, issue 4, 774-783

Abstract: This note is concerned with some essential characteristics of the feasible solutions for a job-shop scheduling problem in which the jobs are constrained by fixed starting times and due dates. These characteristics are related to the scheduling order of operations on each machine and to the fixed starting and completion times for each operation. We present the basic principles enabling one to define these characteristics and propose a procedure for finding them.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.24.4.774 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:24:y:1976:i:4:p:774-783

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().