Batch scheduling to minimize maximum lateness

Files

10.1016-S0167-6377(97)00028-X.pdf (316.04 KB)

Date

1997

Authors

Ghosh, J. B.
Gupta, J. N. D.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
1
views
34
downloads

Citation Stats

  • Share

Series

Abstract

We address the single-machine batch scheduling problem which arises when there are job families and setup requirements exist between these families; our objective is to minimize the maximum lateness. As our main result, we give an improved dynamic program for the solution of the problem.

Source Title

Operations Research Letters

Publisher

Elsevier

Course

Other identifiers

Book Title

Keywords

Analysis of algorithms, Dynamic programming, Production, Scheduling

Degree Discipline

Degree Level

Degree Name

Citation

Permalink

http://hdl.handle.net/11693/11068

Published Version (Please cite this version)

http://dx.doi.org/10.1016/S0167-6377(97)00028-X

Collections

Scholarly Publications - Management

Language

English

Type

Article