Batch scheduling to minimize the weighted number of tardy jobs

Files

Batch scheduling to minimize the weighted number of tardy jobs.pdf (145.59 KB)

Date

2007

Authors

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
2
views
29
downloads

Citation Stats

Series

Abstract

In this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation scheme for the case where the due dates are uniform within a family.

Source Title

Computers and Industrial Engineering

Publisher

Pergamon Press

Course

Other identifiers

Book Title

Keywords

Approximation, Dynamic programming, Industrial engineering, Optimization, Polynomial approximation, Problem solving, Scheduling, Batch scheduling, Batch setup times, Tardy jobs, Job analysis

Degree Discipline

Degree Level

Degree Name

Citation

Permalink

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

Published Version (Please cite this version)

https://doi.org/10.1016/j.cie.2007.03.006

Collections

Scholarly Publications - Management

Language

English

Type

Article