Affordable Access

Publisher Website

Optimal due-date assignment and sequencing in a single machine shop

Authors
Journal
Applied Mathematics Letters
0893-9659
Publisher
Elsevier
Publication Date
Volume
2
Issue
1
Identifiers
DOI: 10.1016/0893-9659(89)90108-0

Abstract

Abstract This paper considers due-date assignments and sequencing of n jobs in a single- machine shop in which each job is given a constant waiting allowance. The objective is to find the optimal value of the waiting allowance and the optimal job sequence to minimize a cost function based on the waiting allowance and the job earliness and tardiness values. We formulate the problem as an LP and find the optimal solution via considering the LP dual problem and show that the optimal waiting allowance is independent of the job sequence.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Optimal assignment of slack due-dates and sequenci...

on Applied Mathematics Letters Jan 01, 1989

Optimal assignment of slack due-date and sequencin...

on Applied Mathematics Letters Jan 01, 1991

Optimal single-machine sequencing and assignment o...

on Computers & Industrial Enginee... Jan 01, 1992

On a single-machine optimal constant due-date assi...

on Applied Mathematics Letters Jan 01, 1988
More articles like this..