SEQUENCING AND BATCHING FOR TWO CLASSES OF JOBS WITH DEADLINES AND SETUP TIMES

David L. Woodruff; M Leroy Spearman

doi:10.1111/j.1937-5956.1992.tb00341.x

← Search

Production and Operations Management 1992

SEQUENCING AND BATCHING FOR TWO CLASSES OF JOBS WITH DEADLINES AND SETUP TIMES

David L. Woodruff¹; M Leroy Spearman²

¹ University of California, Davis · ² Northwestern University

Abstract

We formulate a general sequencing problem that includes two classes of jobs with setup times, setup costs, holding costs, and deadlines. The formulation is unique in its explicit recognition of the opportunities to exploit productive capacity increases due to batching. An algorithm based on tabu search is then used as a solution method. Computational results are presented that suggest that the algorithm is effective.

DOI: 10.1111/j.1937-5956.1992.tb00341.x
Sources: openalex

SEQUENCING AND BATCHING FOR TWO CLASSES OF JOBS WITH DEADLINES AND SETUP TIMES

Abstract

Cite