A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates

J. Erschler, G. Fontan, C. Merce and F. Roubellat
Additional contact information
J. Erschler: Institut National des Sciences Appliquées, Toulouse, France
G. Fontan: Université Paul Sabatier, Toulouse, France
C. Merce: Institut National des Sciences Appliquées, Toulouse, France
F. Roubellat: Centre National de la Recherche Scientifique, Toulouse, France

Operations Research, 1983, vol. 31, issue 1, 114-127

Abstract: Scheduling a set of jobs on a single machine is studied where each job has a specified ready time and due date (limit times). A dominance relationship is established within the set of possible sequences and results in an important restriction of the number of sequences to be considered in solving the feasibility problem. Establishing the dominance relationship leading to this restriction requires only the ordering of ready times and due dates and is thus independent of job processing times and of any change in limit times which does not affect the given order.

Keywords: 583; job; scheduling; on; a; single; machine (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.31.1.114 (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:31:y:1983:i:1:p:114-127

Access Statistics for this article

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