Lower and upper bounds for single machine problem with sequence dependent setup to minimize maximum tardiness

Tardiness is an important measure for customer satisfaction. This paper addresses the lower and upper bounds for the problem of scheduling N jobs on a single machine with due dates, sequence dependent setup times and no preemption where the objective is to minimize the maximum tardiness. Computation...

Full description

Saved in:
Bibliographic Details
Main Authors: Xiaochuan Luo, Chengen Wang, Zhen Liu, Rongxia Qu, Qilin Shu
Format: Conference Proceeding
Language:English
Subjects:
Costs
Customer satisfaction
Job shop scheduling
Laboratories
Manufacturing industries
Manufacturing systems
Processor scheduling
Production systems
Single machine scheduling
Upper bound
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Tardiness is an important measure for customer satisfaction. This paper addresses the lower and upper bounds for the problem of scheduling N jobs on a single machine with due dates, sequence dependent setup times and no preemption where the objective is to minimize the maximum tardiness. Computational experiments demonstrate the effectiveness of the lower and upper bounds.
ISSN:2161-1890
DOI:10.1109/ICSSSM.2005.1499498