Minimizing Lmax for the single machine scheduling problem with family set-ups

Files

Minimizing_Lmax_for_the_single_machine_scheduling_problem_with_family_set-ups.pdf (340.94 KB)

Date

2004

Authors

Schultz, S. R.
Hodgson, T. J.
King, R. E.
Taner, M. R.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

Source Title

International Journal of Production Research

Print ISSN

0020-7543

Electronic ISSN

1366-588X

Publisher

Taylor & Francis

Volume

42

Issue

20

Pages

4315 - 4330

Language

English

Type

Article

Journal Title

Journal ISSN

Volume Title

Citation Stats
Attention Stats
Usage Stats
2
views
27
downloads

Series

Abstract

A procedure for the single machine-scheduling problem of minimizing the maximum lateness for jobs with sequence independent set-ups is presented. The procedure provides optimal/near-optimal solutions over a wide range of problems. It performs well compared with other heuristics, and it is effective in finding solutions for large problems.

Course

Other identifiers

Book Title

Keywords

Algorithms, Approximation theory, Functions, Heuristic methods, Optimal control systems, Scheduling, Batch-partition heuristics, Machine scheduling problem, Pair-wise switching

Degree Discipline

Degree Level

Degree Name

Citation

Permalink

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

Published Version (Please cite this version)

http://dx.doi.org/10.1080/00207540410001716561

Collections

Scholarly Publications - Industrial Engineering