Batch scheduling to minimize maximum lateness

Cataloged from PDF version of article.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. © 1997 Elsevier Science B.V

Two-machine flowshop scheduling with job class setups to minimize total flowtime

Author name used in this publication: T. C. E. Cheng2004-2005 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe