2006•International Journal of Production ResearchRequires access

Some dominance properties for single-machine tardiness problems with sequence-dependent setup

Xiaochuan Luo, Chengbin Chu, Chengen Wang

Abstract

Some dominance properties are proposed for the NP-hard problems of scheduling N jobs on a single machine with due dates, and sequence-dependent setup times. The algorithms based on Ragatz's branch and bound scheme with the dominance properties are developed to minimize the maximum tardiness or the total tardiness. Computational experiments demonstrate the effectiveness of the dominance rules.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 15 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Tardiness, Dominance (genetics), Due date, Scheduling (production processes), Retard, Mathematical optimization, Sequence (biology), Computer science