Scholion.ai

A New Dominance Concept in SchedulingnJobs on a Single Machine with Ready Times and Due Dates

J. Erschler, G. Fontan, C. Merce, F. Roubellat

Operations Research · 1983 · Volume 31 · Issue 1

DOI: 10.1287/opre.31.1.114

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

Enable JavaScript for citation tools and additional paper interactions.