Scheduling Jobs of Equal Durations with Tardiness Costs and Resource Limitations

Trémolières, Raymond

doi:10.1057/jors.1978.50

Cited by 6 publications

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the case where all the job processing times are equal, this drawback disappears because the machine processing capabilities are expressed in number of jobs which can be processed, and the flows between the resources and the jobs have a capacity of 0 or 1 unit (Tremoliere, 1978;Lawler et al, 1982). Our constraints 5-6 become:…”

Section: Previous Workmentioning

confidence: 99%

Scheduling independent jobs on uniform parallel machines to minimize tardiness criteria

Guinet

1995

J Intell Manuf

View full text Add to dashboard Cite

The problem of scheduling N jobs on M uniform parallel machines is studied. The objective is to minimize the mean tardiness or the weighted sum of tardiness with weights based on jobs, on periods or both. For the mean tardiness criteria in the preemptive case, this problem is NP-hard but good solutions can be calculated with a transportation problem algorithm. In the nonpreemptive case the problem is therefore NP-hard, except for the cases with equal job processing times or with job due dates equal to job processing times. No dominant heuristic is known in the general nonpreemptive case. The author has developed a heuristic to solve the nonpreemptive scheduling problem with unrelated job processing times. Initially, the algorithm calculates a basic solution. Next, it considers the interchanges of job subsets to equal processing time sum interchanging resources (i.e. a machine for a given period). This paper models the scheduling problem. It presents the heuristic and its result quality, solving 576 problems for 18 problem sizes. An application of school timetable scheduling illustrates the use of this heuristic.

show abstract

Section: Previous Workmentioning

confidence: 99%